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 listSep 1, 2026 12:16Victor MerckléVictor MerckléScore: 2,904Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 12:172,83431,393,37722,210,0001,029,0002,117,632stderr
2Sep 1, 2026 12:172,85731,570,95022,366,0001,068,0002,117,632stderr
3Sep 1, 2026 12:172,86032,679,55322,355,0001,101,0002,117,632stderr
4Sep 1, 2026 12:172,89433,418,44122,713,0001,022,0002,117,632stderr
5Sep 1, 2026 12:172,90432,063,37222,748,0001,071,0002,117,632stderr
6Sep 1, 2026 12:175,52353,638,72444,074,0001,215,0002,117,632stderr
7Sep 1, 2026 12:175,53453,766,80344,366,0001,013,0002,117,632stderr
8Sep 1, 2026 12:175,56153,879,24944,585,0001,021,0002,117,632stderr
9Sep 1, 2026 12:175,63954,498,86445,221,0001,022,0002,117,632stderr