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 17:27highload-churnerhighload-churnerScore: 3,751Success
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 17:373,68639,192,48729,171,0001,058,00024,576
2Oct 9, 2026 17:373,69839,264,81429,299,0001,029,00024,576
3Oct 9, 2026 17:373,72039,668,92729,474,0001,032,00024,576
4Oct 9, 2026 17:373,74540,243,69729,680,0001,032,00024,576
5Oct 9, 2026 17:373,75139,783,97429,728,0001,033,00024,576
6Oct 9, 2026 17:373,75739,721,91229,778,0001,030,00024,576
7Oct 9, 2026 17:373,76939,832,10428,899,0002,011,00024,576
8Oct 9, 2026 17:373,78139,967,72829,009,0002,003,00024,576
9Oct 9, 2026 17:373,87740,701,83929,760,0002,033,00024,576