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 10:53highload-churnerhighload-churnerScore: 2,510Success
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 10:542,50529,576,55820,542,000020,480
2Oct 13, 2026 10:542,50629,473,72520,554,000020,480
3Oct 13, 2026 10:542,50729,500,42920,562,000020,480
4Oct 13, 2026 10:542,50829,613,81020,571,000020,480
5Oct 13, 2026 10:542,51029,579,44620,582,000020,480
6Oct 13, 2026 10:542,51229,557,07820,603,000020,480
7Oct 13, 2026 10:542,51329,647,72820,608,000020,480
8Oct 13, 2026 10:542,51329,537,66720,608,000020,480
9Oct 13, 2026 10:542,52529,708,45920,707,000020,480