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 9, 2026 20:17highload-churnerhighload-churnerScore: 4,210Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 20:184,11042,677,40032,674,0001,028,00024,576
2Oct 9, 2026 20:184,13742,975,73132,900,0001,028,00024,576
3Oct 9, 2026 20:184,17443,192,48733,200,0001,028,00024,576
4Oct 9, 2026 20:184,18043,231,33033,254,0001,028,00024,576
5Oct 9, 2026 20:184,21043,493,42133,499,0001,026,00024,576
6Oct 9, 2026 20:184,25243,933,53232,862,0002,007,00024,576
7Oct 9, 2026 20:184,29644,162,94134,203,0001,029,00024,576
8Oct 9, 2026 20:1825,424217,615,739207,478,0001,004,00020,480
9Oct 9, 2026 20:1825,735220,026,777210,029,0001,004,00024,576