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 3, 2026 11:21Victor MerckléVictor MerckléScore: 3,072Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 11:232,95332,112,03423,083,0001,137,0002,117,632stderr
2Jul 3, 2026 11:232,95532,157,50923,198,0001,041,0002,117,632stderr
3Jul 3, 2026 11:232,97232,236,13023,344,0001,030,0002,117,632stderr
4Jul 3, 2026 11:233,03032,779,83723,823,0001,028,0002,117,632stderr
5Jul 3, 2026 11:233,07233,153,12724,144,0001,049,0002,117,632stderr
6Jul 3, 2026 11:2311,921105,631,72796,638,0001,119,0002,117,632stderr
7Jul 3, 2026 11:2311,954105,923,69296,928,0001,095,0002,117,632stderr
8Jul 3, 2026 11:2312,016106,419,41197,378,0001,159,0002,117,632stderr
9Jul 3, 2026 11:2312,530110,922,648101,590,0001,160,0002,117,632stderr