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:28highload-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:292,49529,532,23520,461,000020,480
2Oct 15, 2026 00:292,49729,456,16920,476,000020,480
3Oct 15, 2026 00:292,49729,797,51720,482,000020,480
4Oct 15, 2026 00:292,49829,496,25220,490,000020,480
5Oct 15, 2026 00:292,49930,954,87320,498,000020,480
6Oct 15, 2026 00:292,50429,547,29120,536,000020,480
7Oct 15, 2026 00:292,50729,518,26820,562,000020,480
8Oct 15, 2026 00:292,51329,582,10620,614,000020,480
9Oct 15, 2026 00:295,86457,094,39744,691,0003,397,00020,480