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:26highload-churnerhighload-churnerScore: 2,521Success
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:272,51629,565,08520,633,000020,480
2Oct 13, 2026 08:272,51729,560,50820,647,000020,480
3Oct 13, 2026 08:272,52129,736,79120,673,000020,480
4Oct 13, 2026 08:272,52129,665,89320,674,000020,480
5Oct 13, 2026 08:272,52129,670,98820,675,000020,480
6Oct 13, 2026 08:272,52130,154,20620,675,000020,480
7Oct 13, 2026 08:272,52429,579,55920,699,000020,480
8Oct 13, 2026 08:272,52629,649,61320,720,000020,480
9Oct 13, 2026 08:272,53529,737,11119,789,0001,000,00020,480