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 09:39Victor MerckléVictor MerckléScore: 2,621Success
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 09:402,60829,731,03821,393,000024,576stderr
2Sep 8, 2026 09:402,61730,539,45021,466,000024,576stderr
3Sep 8, 2026 09:402,61829,644,95821,471,000024,576stderr
4Sep 8, 2026 09:402,62129,875,68721,500,000024,576stderr
5Sep 8, 2026 09:402,62129,887,90321,500,000024,576stderr
6Sep 8, 2026 09:402,62630,010,05621,535,000024,576stderr
7Sep 8, 2026 09:402,63137,840,78521,577,000024,576stderr
8Sep 8, 2026 09:402,64937,394,22121,728,000024,576stderr
9Sep 8, 2026 09:402,64937,356,88321,722,000024,576stderr