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 listOct 13, 2026 08:54highload-churnerhighload-churnerScore: 35,647Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 08:5535,602301,343,650290,451,0001,492,00024,576stderr
2Oct 13, 2026 08:5535,613301,120,179290,544,0001,484,00024,576stderr
3Oct 13, 2026 08:5535,641301,293,644290,765,0001,499,00024,576stderr
4Oct 13, 2026 08:5535,643301,315,063290,793,0001,485,00024,576stderr
5Oct 13, 2026 08:5535,647301,364,312290,838,0001,474,00024,576stderr
6Oct 13, 2026 08:5535,691301,632,999291,185,0001,482,00024,576stderr
7Oct 13, 2026 08:5535,697301,704,371291,208,0001,511,00024,576stderr
8Oct 13, 2026 08:5535,722302,034,564291,370,0001,555,00024,576stderr
9Oct 13, 2026 08:5535,754302,121,836291,573,0001,614,00024,576stderr