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 15:55Victor MerckléVictor MerckléScore: 2,775Success
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 15:582,74530,887,38521,340,0001,173,0002,117,632stderr
2Aug 23, 2026 15:582,75530,970,21921,587,0001,011,0002,117,632stderr
3Aug 23, 2026 15:582,76030,996,20721,541,0001,098,0002,117,632stderr
4Aug 23, 2026 15:582,77031,108,14921,706,0001,015,0002,117,632stderr
5Aug 23, 2026 15:582,77531,092,37521,734,0001,026,0002,117,632stderr
6Aug 23, 2026 15:585,39052,560,05743,123,0001,077,0002,117,632stderr
7Aug 23, 2026 15:585,41553,419,98343,287,0001,120,0002,117,632stderr
8Aug 23, 2026 15:585,42652,850,63643,383,0001,113,0002,117,632stderr
9Aug 23, 2026 15:585,44953,037,29743,675,0001,014,0002,117,632stderr