[davrosthedalek]

You can always scan through the array, rescale everything by 1/max(input). Then the sleep part is O(1) and the scan part is O(n) -> O(n) total.

[JoshTriplett]

Division isn't O(1) for arbitrary values (potentially larger than a machine word).

[pdw]

The same is true for comparison though, isn't it?

[dalke]

Sleep maxes out at 2147483647 = 2^31 seconds. Generally these problems assume the transdichotomous model, where the machine word size matches the problem size.