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:06highload-churnerhighload-churnerScore: 16,994Success
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:0716,959148,023,628138,029,0001,042,00028,672stderr
2Oct 13, 2026 08:0716,972148,182,175138,148,0001,029,00028,672stderr
3Oct 13, 2026 08:0716,986148,760,774138,258,0001,034,00028,672stderr
4Oct 13, 2026 08:0716,991148,375,130138,319,0001,008,00028,672stderr
5Oct 13, 2026 08:0716,994148,354,940138,344,0001,014,00028,672stderr
6Oct 13, 2026 08:0716,995148,465,327138,361,0001,004,00028,672stderr
7Oct 13, 2026 08:0717,012148,452,391138,441,0001,059,00028,672stderr
8Oct 13, 2026 08:0717,028148,683,628138,623,0001,009,00028,672stderr
9Oct 13, 2026 08:0717,031148,567,179138,607,0001,051,00028,672stderr