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 listAug 29, 2026 11:45Victor MerckléVictor MerckléScore: 2,825Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 11:472,80231,431,51621,868,0001,114,0002,117,632stderr
2Aug 29, 2026 11:472,80231,986,48721,797,0001,181,0002,117,632stderr
3Aug 29, 2026 11:472,81431,411,85121,884,0001,194,0002,117,632stderr
4Aug 29, 2026 11:472,81831,491,21521,923,0001,185,0002,117,632stderr
5Aug 29, 2026 11:472,82531,810,26621,952,0001,220,0002,117,632stderr
6Aug 29, 2026 11:472,83031,577,50522,016,0001,192,0002,117,632stderr
7Aug 29, 2026 11:472,83531,582,48322,034,0001,215,0002,117,632stderr
8Aug 29, 2026 11:472,83631,654,78422,022,0001,235,0002,117,632stderr
9Aug 29, 2026 11:475,48353,335,90243,947,0001,016,0002,117,632stderr