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 9, 2026 04:02highload-churnerhighload-churnerScore: 5,499Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 04:035,31754,165,88241,543,0002,058,0002,117,632
2Oct 9, 2026 04:035,38654,679,84341,997,0002,175,0002,117,632
3Oct 9, 2026 04:035,38954,839,44742,024,0002,171,0002,117,632
4Oct 9, 2026 04:035,43555,124,36842,508,0002,064,0002,117,632
5Oct 9, 2026 04:035,49955,642,22643,060,0002,034,0002,117,632
6Oct 9, 2026 04:035,56956,215,12643,634,0002,034,0002,117,632
7Oct 9, 2026 04:035,61756,608,57644,031,0002,034,0002,117,632
8Oct 9, 2026 04:035,79458,090,43845,484,0002,034,0002,113,536
9Oct 9, 2026 04:0329,763254,591,800241,997,0002,063,0002,117,632