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:23highload-churnerhighload-churnerScore: 67,452Success
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:2567,198560,092,223547,988,0003,041,00032,768stderr
2Oct 13, 2026 12:2567,265560,636,111548,546,0003,034,00032,768stderr
3Oct 13, 2026 12:2567,381561,770,431548,471,0004,057,00032,768stderr
4Oct 13, 2026 12:2567,397561,653,292549,630,0003,031,00032,768stderr
5Oct 13, 2026 12:2567,452562,685,883550,046,0003,061,00032,768stderr
6Oct 13, 2026 12:2567,591563,159,303551,226,0003,024,00032,768stderr
7Oct 13, 2026 12:25268,2352,208,705,4342,196,507,0003,021,00032,768stderr
8Oct 13, 2026 12:251,022,4098,392,903,4718,380,708,0003,047,00024,576stderr
9Oct 13, 2026 12:251,078,9118,856,231,3038,843,050,0004,025,00028,672stderr