I don't think that sleepsort is any more constant time, than any other sorting algorithm. For sleepsort to be constant time, you must

   - have an upper bound on the input (largest number)
   - you must not count some arbitrary things, like the time for spawning a thread.

But if are allowed to do these things, all the other sorts will became constant time. (I believe only one of them is enough.)