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 17:00Victor 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 23, 2026 17:012,73830,814,28221,352,0001,103,0002,117,632stderr
2Aug 23, 2026 17:012,74230,853,01321,403,0001,083,0002,117,632stderr
3Aug 23, 2026 17:012,75530,930,01521,421,0001,172,0002,117,632stderr
4Aug 23, 2026 17:012,75730,940,64721,585,0001,028,0002,117,632stderr
5Aug 23, 2026 17:012,78331,162,00121,629,0001,197,0002,117,632stderr
6Aug 23, 2026 17:012,78531,910,12221,674,0001,167,0002,117,632stderr
7Aug 23, 2026 17:015,35552,674,96342,880,0001,036,0002,117,632stderr
8Aug 23, 2026 17:015,43852,953,67143,447,0001,146,0002,117,632stderr
9Aug 23, 2026 17:015,55453,867,72444,506,0001,041,0002,117,632stderr