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 19, 2026 15:40Victor MerckléVictor MerckléScore: 5,428Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 15:462,74630,864,24721,425,0001,100,0002,117,632stderr
2Aug 19, 2026 15:462,76530,985,62221,576,0001,103,0002,117,632stderr
3Aug 19, 2026 15:462,81232,292,49222,027,0001,036,0002,117,632stderr
4Aug 19, 2026 15:465,42552,808,02543,355,0001,137,0002,117,632stderr
5Aug 19, 2026 15:465,42852,759,34343,451,0001,059,0002,117,632stderr
6Aug 19, 2026 15:465,44555,184,99943,530,0001,126,0002,117,632stderr
7Aug 19, 2026 15:465,45052,832,16143,568,0001,125,0002,117,632stderr
8Aug 19, 2026 15:465,71564,979,32345,679,0001,185,0002,117,632stderr
9Aug 19, 2026 15:465,79763,199,16646,284,0001,254,0002,117,632stderr