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 00:41highload-churnerhighload-churnerScore: 2,734Success
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 00:422,72431,286,40621,335,0001,005,0002,113,536
2Oct 13, 2026 00:422,72631,350,71221,322,0001,034,0002,113,536
3Oct 13, 2026 00:422,73131,356,59621,351,0001,047,0002,113,536
4Oct 13, 2026 00:422,73331,397,73421,383,0001,034,0002,113,536
5Oct 13, 2026 00:422,73431,373,81221,318,0001,105,0002,113,536
6Oct 13, 2026 00:422,73731,395,16721,349,0001,102,0002,113,536
7Oct 13, 2026 00:422,74431,508,04621,402,0001,099,0002,113,536
8Oct 13, 2026 00:422,74531,535,66121,496,0001,019,0002,113,536
9Oct 13, 2026 00:422,76331,609,31221,541,0001,118,0002,113,536