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 17:32Victor MerckléVictor MerckléScore: 2,834Success
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 17:332,74730,634,24821,443,0001,090,0002,117,632stderr
2Aug 23, 2026 17:332,76330,990,45821,484,0001,175,0002,117,632stderr
3Aug 23, 2026 17:332,77131,086,77221,556,0001,171,0002,117,632stderr
4Aug 23, 2026 17:332,77731,081,07521,758,0001,020,0002,117,632stderr
5Aug 23, 2026 17:332,83431,395,03522,034,0001,208,0002,117,632stderr
6Aug 23, 2026 17:332,96541,887,73323,300,0001,019,0002,117,632stderr
7Aug 23, 2026 17:335,37852,404,12243,068,0001,035,0002,117,632stderr
8Aug 23, 2026 17:335,42053,776,85343,313,0001,138,0002,117,632stderr
9Aug 23, 2026 17:335,75264,626,61945,934,0001,237,0002,117,632stderr