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 06:57Victor MerckléVictor MerckléScore: 2,615Success
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 06:582,60229,703,35620,290,0001,050,0002,117,632stderr
2Sep 4, 2026 06:582,61229,827,13220,326,0001,095,0002,117,632stderr
3Sep 4, 2026 06:582,61329,828,22320,371,0001,061,0002,117,632stderr
4Sep 4, 2026 06:582,61329,889,83320,417,0001,016,0002,117,632stderr
5Sep 4, 2026 06:582,61529,858,32220,369,0001,075,0002,117,632stderr
6Sep 4, 2026 06:582,62629,948,17820,468,0001,068,0002,117,632stderr
7Sep 4, 2026 06:585,26651,616,73142,014,0001,169,0002,117,632stderr
8Sep 4, 2026 06:585,29151,754,61342,130,0001,263,0002,117,632stderr
9Sep 4, 2026 06:5811,732104,617,34695,194,0001,010,0002,117,632stderr