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 15, 2026 01:25highload-churnerhighload-churnerScore: 2,496Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 01:262,49030,922,12620,418,000020,480
2Oct 15, 2026 01:262,49329,347,89820,448,000020,480
3Oct 15, 2026 01:262,49329,501,46620,448,000020,480
4Oct 15, 2026 01:262,49629,488,91920,474,000020,480
5Oct 15, 2026 01:262,49629,469,10120,472,000020,480
6Oct 15, 2026 01:262,49729,541,48820,478,000020,480
7Oct 15, 2026 01:265,79056,548,95844,231,0003,249,00020,480
8Oct 15, 2026 01:265,89257,311,91144,868,0003,449,00020,480
9Oct 15, 2026 01:265,91257,476,21944,967,0003,519,00020,480