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 14:18highload-churnerhighload-churnerScore: 68,171Success
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 14:1967,276560,730,478548,595,0003,075,00032,768stderr
2Oct 13, 2026 14:1967,356561,314,105549,300,0003,024,00032,768stderr
3Oct 13, 2026 14:1967,406561,778,898549,688,0003,045,00032,768stderr
4Oct 13, 2026 14:1967,417561,915,749549,772,0003,050,00032,768stderr
5Oct 13, 2026 14:1968,171567,981,020552,782,0006,223,00032,768stderr
6Oct 13, 2026 14:1968,903574,053,207558,653,0006,359,00032,768stderr
7Oct 13, 2026 14:1970,670588,544,612573,260,0006,238,00032,768stderr
8Oct 13, 2026 14:1970,791589,469,371574,021,0006,471,00032,768stderr
9Oct 13, 2026 14:1972,458603,125,521585,120,0009,037,00032,768stderr