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 01:01highload-churnerhighload-churnerScore: 2,496Success
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 01:012,48829,439,21820,403,000020,480
2Oct 15, 2026 01:012,49429,459,12720,454,000020,480
3Oct 15, 2026 01:012,49629,450,98620,469,000020,480
4Oct 15, 2026 01:012,49629,510,25720,474,000020,480
5Oct 15, 2026 01:012,49629,511,76020,475,000020,480
6Oct 15, 2026 01:012,49629,538,81120,473,000020,480
7Oct 15, 2026 01:012,50129,582,29720,516,000020,480
8Oct 15, 2026 01:014,21044,027,19630,986,0003,541,00020,480
9Oct 15, 2026 01:015,93557,887,91945,625,0003,044,00020,480