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:25highload-churnerhighload-churnerScore: 3,886Success
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:343,79940,160,24430,130,0001,029,00024,576
2Oct 9, 2026 20:343,84340,512,92330,449,0001,064,00024,576
3Oct 9, 2026 20:343,86040,614,98229,646,0002,008,00024,576
4Oct 9, 2026 20:343,86844,729,14230,685,0001,033,00024,576
5Oct 9, 2026 20:343,88640,794,28029,818,0002,053,00024,576
6Oct 9, 2026 20:343,88940,842,14030,864,0001,030,00024,576
7Oct 9, 2026 20:343,90640,983,46431,006,0001,029,00024,576
8Oct 9, 2026 20:343,92641,122,74231,171,0001,030,00024,576
9Oct 9, 2026 20:343,95041,335,64330,373,0002,021,00024,576