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 31, 2026 16:57Victor MerckléVictor MerckléScore: 2,871Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 16:582,80831,373,93421,719,0001,308,0002,117,632stderr
2Aug 31, 2026 16:582,81231,465,55321,774,0001,289,0002,117,632stderr
3Aug 31, 2026 16:582,81631,435,03722,048,0001,045,0002,117,632stderr
4Aug 31, 2026 16:582,82431,412,30421,870,0001,289,0002,117,632stderr
5Aug 31, 2026 16:582,87131,899,97622,483,0001,064,0002,117,632stderr
6Aug 31, 2026 16:585,49753,394,21944,055,0001,022,0002,117,632stderr
7Aug 31, 2026 16:585,50053,421,90744,066,0001,041,0002,117,632stderr
8Aug 31, 2026 16:585,53053,698,65143,300,0002,046,0002,117,632stderr
9Aug 31, 2026 16:585,55053,831,98343,474,0002,039,0002,117,632stderr