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 14:29highload-churnerhighload-churnerScore: 2,503Success
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 14:302,49529,522,62520,464,000020,480
2Oct 13, 2026 14:302,49829,486,96420,486,000020,480
3Oct 13, 2026 14:302,50129,564,95420,513,000020,480
4Oct 13, 2026 14:302,50129,449,49820,515,000020,480
5Oct 13, 2026 14:302,50329,526,36420,526,000020,480
6Oct 13, 2026 14:302,50329,625,10920,531,000020,480
7Oct 13, 2026 14:302,50829,632,26920,566,000020,480
8Oct 13, 2026 14:302,52729,701,86620,726,000020,480
9Oct 13, 2026 14:305,86157,109,47744,794,0003,273,00020,480