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:32highload-churnerhighload-churnerScore: 2,506Success
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:332,49829,489,95320,489,000020,480
2Oct 15, 2026 00:332,49829,481,71320,491,000020,480
3Oct 15, 2026 00:332,49929,521,23720,498,000020,480
4Oct 15, 2026 00:332,50129,486,70020,511,000020,480
5Oct 15, 2026 00:332,50629,582,93820,551,000020,480
6Oct 15, 2026 00:332,50829,579,88120,571,000020,480
7Oct 15, 2026 00:335,85056,906,64044,671,0003,307,00020,480
8Oct 15, 2026 00:335,88957,327,62944,849,0003,444,00020,480
9Oct 15, 2026 00:335,91257,458,87745,024,0003,455,00020,480