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 4, 2026 07:59Victor MerckléVictor MerckléScore: 5,277Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 08:052,61729,641,16020,436,0001,028,0002,117,632stderr
2Sep 4, 2026 08:052,61929,893,73320,420,0001,059,0002,117,632stderr
3Sep 4, 2026 08:052,62329,976,31620,472,0001,041,0002,117,632stderr
4Sep 4, 2026 08:052,62930,712,34220,520,0001,045,0002,117,632stderr
5Sep 4, 2026 08:055,27751,676,42142,138,0001,139,0002,117,632stderr
6Sep 4, 2026 08:055,29451,570,27942,270,0001,144,0002,117,632stderr
7Sep 4, 2026 08:055,29551,794,09342,238,0001,183,0002,117,632stderr
8Sep 4, 2026 08:055,31251,938,41542,302,0001,262,0002,117,632stderr
9Sep 4, 2026 08:055,32252,057,11842,436,0001,211,0002,117,632stderr