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:15Victor MerckléVictor MerckléScore: 2,991Success
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:162,94232,129,21222,983,0001,149,0002,117,632stderr
2Jul 7, 2026 10:162,96932,318,49023,227,0001,123,0002,117,632stderr
3Jul 7, 2026 10:162,97632,481,44123,253,0001,157,0002,117,632stderr
4Jul 7, 2026 10:162,98732,516,48223,364,0001,131,0002,117,632stderr
5Jul 7, 2026 10:162,99132,549,72423,405,0001,123,0002,117,632stderr
6Jul 7, 2026 10:162,99332,501,06923,392,0001,153,0002,117,632stderr
7Jul 7, 2026 10:163,01332,724,27323,574,0001,137,0002,117,632stderr
8Jul 7, 2026 10:163,01934,132,80323,633,0001,126,0002,117,632stderr
9Jul 7, 2026 10:1611,736104,268,82495,198,0001,041,0002,117,632stderr