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 listJun 27, 2026 11:21Victor MerckléVictor MerckléScore: 12,793Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 11:233,21635,940,30224,266,0002,107,0002,138,112
2Jun 27, 2026 11:233,25836,413,55624,662,0002,059,0002,138,112
3Jun 27, 2026 11:233,26636,806,84224,725,0002,062,0002,138,112
4Jun 27, 2026 11:233,38237,393,74025,669,0002,065,0002,138,112
5Jun 27, 2026 11:2312,793112,857,992102,838,0002,067,0002,138,112
6Jun 27, 2026 11:2312,837115,207,761103,067,0002,197,0002,138,112
7Jun 27, 2026 11:2312,860113,299,191103,412,0002,043,0002,138,112
8Jun 27, 2026 11:2312,922115,543,029103,807,0002,160,0002,138,112
9Jun 27, 2026 11:2312,924115,010,443103,789,0002,191,0002,138,112