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 13, 2026 14:23highload-churnerhighload-churnerScore: 2,501Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 14:242,49229,455,63520,439,000020,480
2Oct 13, 2026 14:242,49829,449,12820,490,000020,480
3Oct 13, 2026 14:242,49829,453,55220,489,000020,480
4Oct 13, 2026 14:242,49829,456,73020,491,000020,480
5Oct 13, 2026 14:242,50130,098,46120,512,000020,480
6Oct 13, 2026 14:242,50829,495,37420,572,000020,480
7Oct 13, 2026 14:242,51429,668,70120,622,000020,480
8Oct 13, 2026 14:242,51829,594,14420,648,000020,480
9Oct 13, 2026 14:245,89057,251,80845,265,0003,033,00020,480