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 15, 2026 03:47highload-churnerhighload-churnerScore: 2,497Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 03:472,48929,455,19520,410,000020,480
2Oct 15, 2026 03:472,49029,338,19020,422,000020,480
3Oct 15, 2026 03:472,49229,462,16920,441,000020,480
4Oct 15, 2026 03:472,49329,399,09420,445,000020,480
5Oct 15, 2026 03:472,49729,537,33620,480,000020,480
6Oct 15, 2026 03:472,49729,532,83820,479,000020,480
7Oct 15, 2026 03:472,52929,781,80319,693,0001,049,00020,480
8Oct 15, 2026 03:473,47537,530,89325,180,0003,323,00020,480
9Oct 15, 2026 03:475,82256,761,32544,517,0003,226,00020,480