The question is in the title. I'm interested in submissions that terminate with probability 1 but have unbounded worst case running times.
This is related to the question Do programs have to terminate?, but that question is specifically about submissions that definitely do not terminate.
For example, the challenge is "sort the array". Should an implementation of a randomized bogosort (shuffle the elements and see if the result is sorted) be permitted?