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 9, 2026 07:20Victor MerckléVictor MerckléScore: 2,940Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 07:212,85531,409,56022,315,0001,104,0002,117,632stderr
2Jul 9, 2026 07:212,85631,373,56022,304,0001,116,0002,117,632stderr
3Jul 9, 2026 07:212,88131,655,66422,526,0001,105,0002,117,632stderr
4Jul 9, 2026 07:212,88931,742,69622,576,0001,120,0002,117,632stderr
5Jul 9, 2026 07:212,94032,064,42723,005,0001,109,0002,117,632stderr
6Jul 9, 2026 07:2111,724104,171,26395,105,0001,037,0002,117,632stderr
7Jul 9, 2026 07:2111,790104,700,63695,540,0001,142,0002,117,632stderr
8Jul 9, 2026 07:2111,815104,951,12295,721,0001,162,0002,117,632stderr
9Jul 9, 2026 07:2112,218108,279,87199,160,0001,034,0002,117,632stderr