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:09Victor 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:102,85631,478,72222,299,0001,121,0002,117,632stderr
2Jul 9, 2026 07:102,86531,551,28922,387,0001,110,0002,117,632stderr
3Jul 9, 2026 07:102,89431,758,47522,636,0001,102,0002,117,632stderr
4Jul 9, 2026 07:102,93132,045,04622,932,0001,106,0002,117,632stderr
5Jul 9, 2026 07:102,94032,091,21823,004,0001,106,0002,117,632stderr
6Jul 9, 2026 07:1011,637103,442,84294,407,0001,023,0002,117,632stderr
7Jul 9, 2026 07:1012,019106,558,18497,541,0001,015,0002,117,632stderr
8Jul 9, 2026 07:1012,164107,739,82598,687,0001,059,0002,117,632stderr
9Jul 9, 2026 07:1012,360109,343,943100,192,0001,164,0002,117,632stderr