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 05:09highload-churnerhighload-churnerScore: 2,498Success
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 05:102,48729,354,96920,399,000020,480
2Oct 15, 2026 05:102,48830,382,47820,404,000020,480
3Oct 15, 2026 05:102,49029,444,00320,423,000020,480
4Oct 15, 2026 05:102,49029,505,34420,423,000020,480
5Oct 15, 2026 05:102,49829,502,83020,491,000020,480
6Oct 15, 2026 05:102,51529,692,57420,627,000020,480
7Oct 15, 2026 05:105,84956,967,64244,644,0003,323,00020,480
8Oct 15, 2026 05:105,87257,221,93145,113,0003,042,00020,480
9Oct 15, 2026 05:105,92357,644,63345,534,0003,042,00020,480