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 listSep 8, 2026 18:00Victor MerckléVictor MerckléScore: 2,578Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 18:042,54729,393,61020,893,000024,576stderr
2Sep 8, 2026 18:042,55529,412,84820,958,000024,576stderr
3Sep 8, 2026 18:042,55829,183,77520,982,000024,576stderr
4Sep 8, 2026 18:042,56429,239,65921,025,000024,576stderr
5Sep 8, 2026 18:042,57829,353,53421,140,000024,576stderr
6Sep 8, 2026 18:042,58429,500,00721,195,000024,576stderr
7Sep 8, 2026 18:042,61229,927,92321,421,000024,576stderr
8Sep 8, 2026 18:042,62029,911,45421,488,000024,576stderr
9Sep 8, 2026 18:045,50753,506,13644,145,0001,014,00024,576stderr