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 listOct 15, 2024 23:40zielajzielajScore: 104,321Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2024 23:4099,964844,560,531694,747,000124,954,0002,469,888
2Oct 15, 2024 23:40104,321877,305,250726,516,000128,914,0002,314,240
3Oct 15, 2024 23:40121,2591,014,174,867856,418,000137,906,0002,486,272