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 8, 2026 12:26Victor MerckléVictor MerckléScore: 2,925Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 12:272,85231,448,54222,369,0001,024,0002,117,632stderr
2Jul 8, 2026 12:272,86931,591,37922,505,0001,022,0002,117,632stderr
3Jul 8, 2026 12:272,88231,666,83322,619,0001,014,0002,117,632stderr
4Jul 8, 2026 12:272,92232,383,89122,932,0001,034,0002,117,632stderr
5Jul 8, 2026 12:272,92532,519,97922,973,0001,019,0002,117,632stderr
6Jul 8, 2026 12:2711,655103,504,44494,533,0001,046,0002,117,632stderr
7Jul 8, 2026 12:2711,733104,656,37995,073,0001,141,0002,117,632stderr
8Jul 8, 2026 12:2711,768104,525,91095,376,0001,122,0002,117,632stderr
9Jul 8, 2026 12:2712,230108,440,10199,236,0001,054,0002,117,632stderr