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 00:13highload-churnerhighload-churnerScore: 2,499Success
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 00:142,49629,545,15520,468,000020,480
2Oct 15, 2026 00:142,49729,440,85720,478,000020,480
3Oct 15, 2026 00:142,49729,549,87420,478,000020,480
4Oct 15, 2026 00:142,49829,574,71520,489,000020,480
5Oct 15, 2026 00:142,49929,519,92820,494,000020,480
6Oct 15, 2026 00:142,50129,543,68620,514,000020,480
7Oct 15, 2026 00:142,50329,592,08520,526,000020,480
8Oct 15, 2026 00:142,50829,626,36220,571,000020,480
9Oct 15, 2026 00:145,94157,757,24945,368,0003,354,00020,480