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 10, 2026 13:25Pavel SkripkinPavel SkripkinScore: 4,220Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 13:264,10941,112,33530,591,0003,107,0002,117,632
2May 10, 2026 13:264,12443,221,83530,684,0003,133,0002,117,632
3May 10, 2026 13:264,16741,523,98530,948,0003,223,0002,117,632
4May 10, 2026 13:264,17149,098,97331,158,0003,052,0002,117,632
5May 10, 2026 13:264,22041,838,65831,326,0003,281,0002,117,632
6May 10, 2026 13:2624,588211,330,241198,468,0003,156,0002,117,632
7May 10, 2026 13:2624,651211,788,247199,099,0003,046,0002,117,632
8May 10, 2026 13:2625,018214,732,886202,053,0003,101,0002,117,632
9May 10, 2026 13:2625,872219,435,917209,017,0003,135,0002,117,632