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 2, 2026 14:39Victor MerckléVictor MerckléScore: 3,043Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 14:402,96732,630,86023,296,0001,034,0002,117,632stderr
2Jul 2, 2026 14:403,00932,568,84023,642,0001,032,0002,117,632stderr
3Jul 2, 2026 14:403,01732,964,35523,727,0001,015,0002,117,632stderr
4Jul 2, 2026 14:403,01832,685,00823,686,0001,068,0002,117,632stderr
5Jul 2, 2026 14:403,04333,038,17723,942,0001,015,0002,117,632stderr
6Jul 2, 2026 14:4011,869105,309,99896,322,0001,007,0002,117,632stderr
7Jul 2, 2026 14:4011,870105,270,21496,227,0001,114,0002,117,632stderr
8Jul 2, 2026 14:4011,921105,727,35196,629,0001,129,0002,117,632stderr
9Jul 2, 2026 14:4011,961106,218,07696,952,0001,130,0002,117,632stderr