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 12:46Victor MerckléVictor MerckléScore: 2,563Success
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 12:472,55129,274,42520,926,000024,576stderr
2Sep 8, 2026 12:472,55229,306,78520,933,000024,576stderr
3Sep 8, 2026 12:472,55329,140,29020,936,000024,576stderr
4Sep 8, 2026 12:472,56129,310,26121,004,000024,576stderr
5Sep 8, 2026 12:472,56329,327,50121,019,000024,576stderr
6Sep 8, 2026 12:472,56729,403,80121,057,000024,576stderr
7Sep 8, 2026 12:472,60429,635,79421,354,000024,576stderr
8Sep 8, 2026 12:472,63930,730,13421,645,000024,576stderr
9Sep 8, 2026 12:472,64329,979,05121,673,000024,576stderr