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:19Victor MerckléVictor MerckléScore: 5,487Success
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:212,80431,432,88821,818,0001,179,0002,117,632stderr
2Aug 19, 2026 15:212,80631,153,61921,869,0001,144,0002,117,632stderr
3Aug 19, 2026 15:212,81731,378,58822,080,0001,026,0002,117,632stderr
4Aug 19, 2026 15:212,82131,553,86221,941,0001,193,0002,117,632stderr
5Aug 19, 2026 15:215,48753,127,47043,979,0001,019,0002,117,632stderr
6Aug 19, 2026 15:215,52254,251,19744,265,0001,018,0002,117,632stderr
7Aug 19, 2026 15:215,52753,591,82144,305,0001,019,0002,117,632stderr
8Aug 19, 2026 15:215,55753,842,49844,556,0001,018,0002,117,632stderr
9Aug 19, 2026 15:215,56354,607,74644,603,0001,018,0002,117,632stderr