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:40Victor MerckléVictor MerckléScore: 2,783Success
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:412,75930,966,87421,477,0001,152,0002,117,632stderr
2Aug 31, 2026 16:412,75931,010,25421,402,0001,228,0002,117,632stderr
3Aug 31, 2026 16:412,76431,712,22621,430,0001,239,0002,117,632stderr
4Aug 31, 2026 16:412,77331,140,99221,509,0001,237,0002,117,632stderr
5Aug 31, 2026 16:412,78331,162,00321,580,0001,241,0002,117,632stderr
6Aug 31, 2026 16:412,78331,161,71821,584,0001,240,0002,117,632stderr
7Aug 31, 2026 16:412,80931,415,50121,912,0001,129,0002,117,632stderr
8Aug 31, 2026 16:415,40959,725,41843,146,0001,210,0002,117,632stderr
9Aug 31, 2026 16:415,42752,810,52943,293,0001,212,0002,117,632stderr