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 03:02highload-churnerhighload-churnerScore: 2,497Success
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 03:032,49029,383,88720,424,000020,480
2Oct 15, 2026 03:032,49229,428,56320,435,000020,480
3Oct 15, 2026 03:032,49329,336,97420,444,000020,480
4Oct 15, 2026 03:032,49529,497,98520,465,000020,480
5Oct 15, 2026 03:032,49729,510,02820,477,000020,480
6Oct 15, 2026 03:032,49829,542,92120,488,000020,480
7Oct 15, 2026 03:032,50029,487,36420,501,000020,480
8Oct 15, 2026 03:032,50129,644,43320,515,000020,480
9Oct 15, 2026 03:032,50429,540,77620,538,000020,480