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 18:50Victor MerckléVictor MerckléScore: 2,867Success
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 18:512,75831,008,94521,602,0001,014,0002,117,632stderr
2Aug 23, 2026 18:512,77831,125,96621,609,0001,172,0002,117,632stderr
3Aug 23, 2026 18:512,78431,782,49721,738,0001,097,0002,117,632stderr
4Aug 23, 2026 18:512,83431,545,14522,135,0001,104,0002,117,632stderr
5Aug 23, 2026 18:512,86750,140,26522,433,0001,077,0002,117,632stderr
6Aug 23, 2026 18:515,38152,455,21943,074,0001,051,0002,117,632stderr
7Aug 23, 2026 18:515,42453,487,20843,419,0001,063,0002,117,632stderr
8Aug 23, 2026 18:515,60560,903,91944,801,0001,164,0002,117,632stderr
9Aug 23, 2026 18:5114,471126,994,129117,655,0001,014,0002,117,632stderr