Median Sergey Svistunov

Find the median of a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listMar 21, 2024 02:05IhebIhebScore: 986,551Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2024 02:05983,3428,126,770,9918,063,402,14402,289,664
2Mar 21, 2024 02:05986,5518,152,285,1928,089,719,54202,293,760
3Mar 21, 2024 02:05988,4868,161,944,2088,105,581,97002,293,760