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:33highload-churnerhighload-churnerScore: 67,320Success
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:3467,208560,133,148547,078,0004,033,00032,768stderr
2Oct 13, 2026 14:3467,246560,475,013548,379,0003,039,00032,768stderr
3Oct 13, 2026 14:3467,273560,726,373548,601,0003,041,00032,768stderr
4Oct 13, 2026 14:3467,288560,870,817548,723,0003,040,00032,768stderr
5Oct 13, 2026 14:3467,320561,079,797549,004,0003,021,00032,768stderr
6Oct 13, 2026 14:3477,281642,907,680615,860,00017,850,00032,768stderr
7Oct 13, 2026 14:3477,305643,027,891622,627,00011,274,00032,768stderr
8Oct 13, 2026 14:34142,1301,174,577,8201,098,036,00067,434,00032,768stderr
9Oct 13, 2026 14:34159,7621,319,121,0821,239,824,00070,232,00032,768stderr