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 12:51highload-churnerhighload-churnerScore: 469,994Success
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 12:52269,6472,220,265,5132,208,028,0003,078,00028,672stderr
2Oct 13, 2026 12:52454,2813,734,336,9593,722,078,0003,027,00028,672stderr
3Oct 13, 2026 12:52463,6703,811,237,7083,799,024,0003,077,00028,672stderr
4Oct 13, 2026 12:52467,2873,841,301,9363,827,492,0004,269,00028,672stderr
5Oct 13, 2026 12:52469,9943,863,035,4873,850,891,0003,060,00028,672stderr
6Oct 13, 2026 12:52472,5143,884,138,0653,870,577,0004,044,00028,672stderr
7Oct 13, 2026 12:52476,4983,916,404,7433,904,259,0003,031,00028,672stderr
8Oct 13, 2026 12:52477,2063,922,718,8153,910,062,0003,032,00028,672stderr
9Oct 13, 2026 12:52581,2734,775,528,4494,763,381,0003,063,00028,672stderr