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:48Victor MerckléVictor MerckléScore: 2,939Success
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:492,88531,580,25322,518,0001,145,0002,117,632stderr
2Jul 4, 2026 05:492,88931,635,06322,676,0001,019,0002,117,632stderr
3Jul 4, 2026 05:492,89431,650,41822,581,0001,152,0002,117,632stderr
4Jul 4, 2026 05:492,92931,962,36022,993,0001,026,0002,117,632stderr
5Jul 4, 2026 05:492,93932,011,40923,085,0001,021,0002,117,632stderr
6Jul 4, 2026 05:492,97232,314,49023,244,0001,128,0002,117,632stderr
7Jul 4, 2026 05:4911,664103,583,91494,613,0001,032,0002,117,632stderr
8Jul 4, 2026 05:4911,717104,003,61395,032,0001,049,0002,117,632stderr
9Jul 4, 2026 05:4911,751104,265,02195,210,0001,151,0002,117,632stderr