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:06highload-churnerhighload-churnerScore: 2,510Success
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:072,49629,573,15020,473,000020,480
2Oct 13, 2026 14:072,49929,536,83420,494,000020,480
3Oct 13, 2026 14:072,50129,785,18720,516,000020,480
4Oct 13, 2026 14:072,50329,738,57420,532,000020,480
5Oct 13, 2026 14:072,51029,574,93220,583,000020,480
6Oct 13, 2026 14:074,14842,971,19730,731,0003,285,00020,480
7Oct 13, 2026 14:075,85156,977,14344,685,0003,299,00020,480
8Oct 13, 2026 14:075,85557,000,98044,713,0003,301,00020,480
9Oct 13, 2026 14:075,93557,693,39845,271,0003,397,00020,480