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 29, 2026 13:13Victor MerckléVictor MerckléScore: 2,761Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 13:142,72630,524,10021,237,0001,124,0002,117,632stderr
2Aug 29, 2026 13:142,74730,902,56921,512,0001,014,0002,117,632stderr
3Aug 29, 2026 13:142,75130,840,47321,546,0001,017,0002,117,632stderr
4Aug 29, 2026 13:142,75230,943,32921,557,0001,015,0002,117,632stderr
5Aug 29, 2026 13:142,76130,784,67721,611,0001,033,0002,117,632stderr
6Aug 29, 2026 13:145,38152,454,65843,073,0001,054,0002,117,632stderr
7Aug 29, 2026 13:145,40552,505,77443,211,0001,114,0002,117,632stderr
8Aug 29, 2026 13:145,44552,952,67443,598,0001,051,0002,117,632stderr
9Aug 29, 2026 13:145,45052,817,74843,671,0001,019,0002,117,632stderr