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 4, 2026 05:58Victor MerckléVictor MerckléScore: 11,682Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 05:592,85931,326,11822,381,0001,066,0002,117,632stderr
2Jul 4, 2026 05:592,87131,506,52222,463,0001,084,0002,117,632stderr
3Jul 4, 2026 05:592,93332,049,95022,991,0001,060,0002,117,632stderr
4Jul 4, 2026 05:592,93732,069,18822,956,0001,129,0002,117,632stderr
5Jul 4, 2026 05:5911,682103,706,12994,692,0001,108,0002,117,632stderr
6Jul 4, 2026 05:5911,728104,149,96095,013,0001,159,0002,117,632stderr
7Jul 4, 2026 05:5911,743104,168,56495,103,0001,190,0002,117,632stderr
8Jul 4, 2026 05:5911,829105,049,24895,772,0001,233,0002,117,632stderr
9Jul 4, 2026 05:5911,831104,873,82696,010,0001,006,0002,117,632stderr