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 listJul 7, 2026 07:25Victor MerckléVictor MerckléScore: 3,305Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 07:263,06935,532,29523,050,0002,122,0002,142,208stderr
2Jul 7, 2026 07:263,08736,108,94323,198,0002,123,0002,142,208stderr
3Jul 7, 2026 07:263,10337,246,40524,396,0001,053,0002,142,208stderr
4Jul 7, 2026 07:263,13335,464,21424,638,0001,053,0002,142,208stderr
5Jul 7, 2026 07:263,30537,398,87724,894,0002,210,0002,142,208stderr
6Jul 7, 2026 07:2612,543113,776,255100,606,0002,249,0002,142,208stderr
7Jul 7, 2026 07:2612,575113,792,769100,006,0003,117,0002,142,208stderr
8Jul 7, 2026 07:2612,603111,374,254101,141,0002,209,0002,142,208stderr
9Jul 7, 2026 07:2612,705115,639,637102,007,0002,180,0002,142,208stderr