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 14:12Victor MerckléVictor MerckléScore: 2,850Success
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 14:132,80431,323,00421,913,0001,084,0002,117,632stderr
2Aug 23, 2026 14:132,81331,210,48422,041,0001,027,0002,117,632stderr
3Aug 23, 2026 14:132,82931,401,36422,109,0001,092,0002,117,632stderr
4Aug 23, 2026 14:132,83931,661,97422,253,0001,028,0002,117,632stderr
5Aug 23, 2026 14:132,85032,026,97822,354,0001,018,0002,117,632stderr
6Aug 23, 2026 14:135,49853,287,16443,955,0001,132,0002,117,632stderr
7Aug 23, 2026 14:135,50253,437,55543,995,0001,125,0002,117,632stderr
8Aug 23, 2026 14:135,50953,530,35344,046,0001,133,0002,117,632stderr
9Aug 23, 2026 14:135,53153,749,63644,239,0001,119,0002,117,632stderr