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:53Victor MerckléVictor MerckléScore: 2,972Success
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:552,91531,713,30522,791,0001,120,0002,117,632stderr
2Jul 7, 2026 10:552,92431,753,40022,861,0001,119,0002,117,632stderr
3Jul 7, 2026 10:552,94532,573,93723,121,0001,029,0002,117,632stderr
4Jul 7, 2026 10:552,96232,725,21923,265,0001,025,0002,117,632stderr
5Jul 7, 2026 10:552,97232,158,92123,345,0001,029,0002,117,632stderr
6Jul 7, 2026 10:552,97333,876,80323,366,0001,016,0002,117,632stderr
7Jul 7, 2026 10:553,00432,479,97723,629,0001,011,0002,117,632stderr
8Jul 7, 2026 10:553,02632,608,99823,795,0001,019,0002,117,632stderr
9Jul 7, 2026 10:5511,942105,897,69696,880,0001,047,0002,117,632stderr