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 23, 2026 16:45Victor MerckléVictor MerckléScore: 3,335Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 16:472,80631,334,69921,860,0001,154,0002,117,632stderr
2Aug 23, 2026 16:472,80631,350,99121,853,0001,157,0002,117,632stderr
3Aug 23, 2026 16:472,81232,090,33021,879,0001,185,0002,117,632stderr
4Aug 23, 2026 16:472,82831,589,38322,033,0001,159,0002,117,632stderr
5Aug 23, 2026 16:473,33535,705,31526,311,0001,038,0002,117,632stderr
6Aug 23, 2026 16:475,50754,236,37344,146,0001,019,0002,117,632stderr
7Aug 23, 2026 16:475,51254,141,48344,177,0001,024,0002,117,632stderr
8Aug 23, 2026 16:475,53853,887,55644,394,0001,018,0002,117,632stderr
9Aug 23, 2026 16:475,54254,523,89844,424,0001,022,0002,117,632stderr