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:35highload-churnerhighload-churnerScore: 166,108Success
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:3667,253560,633,490548,436,0003,040,00032,768stderr
2Oct 13, 2026 12:3667,266560,600,745547,497,0004,085,00032,768stderr
3Oct 13, 2026 12:3667,386561,628,847549,513,0003,055,00032,768stderr
4Oct 13, 2026 12:3667,606563,337,091551,348,0003,023,00032,768stderr
5Oct 13, 2026 12:36166,1081,371,382,6051,356,769,0005,318,00032,768stderr
6Oct 13, 2026 12:36168,0871,387,384,1261,375,268,0003,050,00032,768stderr
7Oct 13, 2026 12:36504,4974,146,294,1284,131,840,0005,042,00032,768stderr
8Oct 13, 2026 12:361,047,0648,595,049,3938,580,636,0005,294,00028,672stderr
9Oct 13, 2026 12:361,068,5068,771,623,4528,757,732,0004,019,00028,672stderr