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 10:48Victor MerckléVictor MerckléScore: 2,885Success
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 10:492,85331,419,97622,282,0001,117,0002,117,632stderr
2Jul 7, 2026 10:492,85531,464,45722,260,0001,157,0002,117,632stderr
3Jul 7, 2026 10:492,86831,519,43122,504,0001,016,0002,117,632stderr
4Jul 7, 2026 10:492,86831,486,84022,405,0001,118,0002,117,632stderr
5Jul 7, 2026 10:492,88531,631,61522,551,0001,110,0002,117,632stderr
6Jul 7, 2026 10:4911,707103,967,28194,943,0001,056,0002,117,632stderr
7Jul 7, 2026 10:4911,749104,343,61695,202,0001,141,0002,117,632stderr
8Jul 7, 2026 10:4912,218108,217,37699,070,0001,122,0002,117,632stderr
9Jul 7, 2026 10:4912,812113,080,058104,055,0001,009,0002,117,632stderr