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 listMay 9, 2026 08:09Pavel SkripkinPavel SkripkinScore: 5,613Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 08:105,33656,213,59736,078,0007,685,0002,306,048
2May 9, 2026 08:105,49362,864,15836,844,0008,202,0002,523,136
3May 9, 2026 08:105,57660,484,50437,171,0008,560,0002,506,752
4May 9, 2026 08:105,60563,964,42337,390,0008,574,0002,494,464
5May 9, 2026 08:105,61363,463,16537,319,0008,714,0002,367,488
6May 9, 2026 08:105,65559,656,55837,778,0008,594,0002,469,888
7May 9, 2026 08:105,79460,836,98138,337,0009,179,0002,506,752
8May 9, 2026 08:105,81663,873,14638,651,0009,048,0002,383,872
9May 9, 2026 08:105,86262,963,15338,661,0009,414,0002,560,000