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 listMay 1, 2026 09:58Victor MerckléVictor MerckléScore: 14,220Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 09:594,02548,639,02731,007,0002,000,0002,420,736
2May 1, 2026 09:594,03754,385,71329,095,0004,013,0002,334,720
3May 1, 2026 09:594,14257,084,54531,969,0001,998,0002,420,736
4May 1, 2026 09:5914,219138,372,419115,598,0001,005,0002,428,928
5May 1, 2026 09:5914,220135,834,362114,614,0001,993,0002,433,024
6May 1, 2026 09:5914,224138,117,913114,648,0001,993,0002,379,776
7May 1, 2026 09:5914,349136,756,355115,675,0001,994,0002,363,392
8May 1, 2026 09:5914,366137,645,068111,817,0005,990,0002,453,504
9May 1, 2026 09:5914,406141,239,903115,128,0003,003,0002,428,928