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:13highload-churnerhighload-churnerScore: 67,424Success
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:1467,258560,730,915548,441,0003,075,00032,768stderr
2Oct 13, 2026 14:1467,311560,958,441548,902,0003,053,00032,768stderr
3Oct 13, 2026 14:1467,405561,726,584549,706,0003,022,00032,768stderr
4Oct 13, 2026 14:1467,409561,694,674549,732,0003,022,00032,768stderr
5Oct 13, 2026 14:1467,424562,038,592549,801,0003,081,00032,768stderr
6Oct 13, 2026 14:14130,9851,083,149,5441,022,214,00051,868,00032,768stderr
7Oct 13, 2026 14:14131,1571,084,527,8891,023,290,00052,205,00032,768stderr
8Oct 13, 2026 14:14139,6621,154,396,3211,075,436,00069,798,00032,768stderr
9Oct 13, 2026 14:14160,3901,324,253,6561,244,385,00070,817,00032,768stderr