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 13:02highload-churnerhighload-churnerScore: 2,502Success
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 13:032,49929,554,31320,498,000020,480
2Oct 13, 2026 13:032,50029,491,47920,502,000020,480
3Oct 13, 2026 13:032,50129,471,73920,514,000020,480
4Oct 13, 2026 13:032,50230,855,27820,519,000020,480
5Oct 13, 2026 13:032,50230,337,17920,520,000020,480
6Oct 13, 2026 13:032,50329,565,53020,531,000020,480
7Oct 13, 2026 13:032,50429,538,83720,540,000020,480
8Oct 13, 2026 13:032,50633,525,55920,552,000020,480
9Oct 13, 2026 13:032,51729,586,01320,645,000020,480