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 14, 2026 19:25Victor MerckléVictor MerckléScore: 3,008Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 19:262,89331,551,26222,701,0001,026,0002,117,632stderr
2Jul 14, 2026 19:262,91131,817,52122,753,0001,121,0002,117,632stderr
3Jul 14, 2026 19:262,92131,872,41422,850,0001,107,0002,117,632stderr
4Jul 14, 2026 19:262,99932,757,16423,472,0001,124,0002,117,632stderr
5Jul 14, 2026 19:263,00833,170,41523,613,0001,058,0002,117,632stderr
6Jul 14, 2026 19:2611,835104,925,07996,019,0001,030,0002,117,632stderr
7Jul 14, 2026 19:2611,851105,183,30096,132,0001,049,0002,117,632stderr
8Jul 14, 2026 19:2611,938105,865,70596,763,0001,136,0002,117,632stderr
9Jul 14, 2026 19:2612,080106,934,15197,806,0001,251,0002,117,632stderr