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:56highload-churnerhighload-churnerScore: 67,416Success
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:5767,227560,302,443548,212,0003,057,00032,768stderr
2Oct 13, 2026 12:5767,328561,144,359549,041,0003,050,00032,768stderr
3Oct 13, 2026 12:5767,375561,463,791549,470,0003,013,00032,768stderr
4Oct 13, 2026 12:5767,375561,543,308549,426,0003,055,00032,768stderr
5Oct 13, 2026 12:5767,416561,908,949549,774,0003,044,00032,768stderr
6Oct 13, 2026 12:5767,744564,492,299552,458,0003,048,00032,768stderr
7Oct 13, 2026 12:57588,7434,836,869,6644,824,667,0003,027,00028,672stderr
8Oct 13, 2026 12:57712,6145,852,614,7665,839,371,0004,071,00028,672stderr
9Oct 13, 2026 12:571,072,1678,802,277,8218,786,672,0005,104,00028,672stderr