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 2, 2026 14:11Victor MerckléVictor MerckléScore: 11,998Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 14:112,99532,443,13923,508,0001,053,0002,117,632stderr
2Jul 2, 2026 14:113,02532,717,39323,710,0001,097,0002,117,632stderr
3Jul 2, 2026 14:113,04932,941,96123,915,0001,093,0002,117,632stderr
4Jul 2, 2026 14:1111,948105,852,39696,966,0001,008,0002,117,632stderr
5Jul 2, 2026 14:1111,998106,361,49997,379,0001,009,0002,117,632stderr
6Jul 2, 2026 14:1112,008106,292,92897,462,0001,009,0002,117,632stderr
7Jul 2, 2026 14:1112,010106,378,03997,482,0001,007,0002,117,632stderr
8Jul 2, 2026 14:1112,013106,374,63397,499,0001,010,0002,117,632stderr
9Jul 2, 2026 14:1112,060106,904,32197,885,0001,008,0002,117,632stderr