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 listAug 29, 2026 08:52Victor MerckléVictor MerckléScore: 5,507Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 08:532,90632,150,91322,784,0001,051,0002,117,632stderr
2Aug 29, 2026 08:532,91132,217,41122,822,0001,055,0002,117,632stderr
3Aug 29, 2026 08:532,91232,200,97022,833,0001,052,0002,117,632stderr
4Aug 29, 2026 08:532,96032,713,29622,124,0002,154,0002,117,632stderr
5Aug 29, 2026 08:535,50753,469,48043,104,0002,057,0002,117,632stderr
6Aug 29, 2026 08:535,51553,614,44143,161,0002,065,0002,117,632stderr
7Aug 29, 2026 08:535,52253,629,12943,153,0002,135,0002,117,632stderr
8Aug 29, 2026 08:535,52353,666,00243,198,0002,097,0002,117,632stderr
9Aug 29, 2026 08:535,54953,893,44443,313,0002,192,0002,117,632stderr