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 14, 2026 18:27marko1597marko1597Score: 3,826Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 18:373,68238,515,05529,153,0001,044,0002,121,728stderr
2Aug 14, 2026 18:373,75039,173,55429,725,0001,032,0002,121,728stderr
3Aug 14, 2026 18:373,75339,025,02229,749,0001,026,0002,121,728stderr
4Aug 14, 2026 18:373,79639,357,81530,097,0001,037,0002,121,728stderr
5Aug 14, 2026 18:373,82639,719,91830,334,0001,043,0002,121,728stderr
6Aug 14, 2026 18:373,83039,773,62930,381,0001,027,0002,121,728stderr
7Aug 14, 2026 18:373,84639,789,64530,515,0001,030,0002,121,728stderr
8Aug 14, 2026 18:3712,205108,461,99094,672,0005,414,0002,121,728stderr
9Aug 14, 2026 18:3712,493110,809,47096,959,0005,488,0002,121,728stderr