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 listJul 4, 2026 04:53Victor MerckléVictor MerckléScore: 3,520Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 04:543,46436,264,94027,375,0001,034,0002,117,632stderr
2Jul 4, 2026 04:543,47536,380,78527,467,0001,028,0002,117,632stderr
3Jul 4, 2026 04:543,48936,680,62127,588,0001,024,0002,117,632stderr
4Jul 4, 2026 04:543,51737,042,12527,832,0001,014,0002,117,632stderr
5Jul 4, 2026 04:543,52036,626,88027,797,0001,068,0002,117,632stderr
6Jul 4, 2026 04:543,52136,810,58927,860,0001,014,0002,117,632stderr
7Jul 4, 2026 04:5412,733112,205,003103,187,0001,228,0002,117,632stderr
8Jul 4, 2026 04:5412,778112,716,691103,629,0001,158,0002,117,632stderr
9Jul 4, 2026 04:5413,279117,217,489107,878,0001,010,0002,117,632stderr