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 10, 2026 00:39highload-churnerhighload-churnerScore: 3,360Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2026 02:113,30636,044,49226,081,0001,031,00024,576
2Oct 10, 2026 02:113,30736,110,73226,065,0001,058,00024,576
3Oct 10, 2026 02:113,32336,109,16926,224,0001,031,00024,576
4Oct 10, 2026 02:113,35336,487,56226,467,0001,034,00024,576
5Oct 10, 2026 02:113,36036,508,82526,524,0001,032,00024,576
6Oct 10, 2026 02:113,36236,600,13826,541,0001,034,00024,576
7Oct 10, 2026 02:113,41636,998,03626,988,0001,031,00024,576
8Oct 10, 2026 02:113,42336,999,77427,039,0001,031,00024,576
9Oct 10, 2026 02:1127,000230,992,637220,400,0001,006,00024,576