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 12, 2026 16:00highload-churnerhighload-churnerError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 16:000304,951,364294,932,0001,004,0002,113,536expected "2146332339 ", got "hh0wmh0whh0wnh0wih0whh0whh0whh0wch0wih0wih0whh0wmh0whh0woh0wih0woh0whh0wih0wdh0wlh0wih0wlh0wah0weh0whh0wih0wah0wbh0weh0wnh0whh0wfh0wfh0wdh0whh0whh0wbh0whh0whh0w "
2Oct 12, 2026 16:000293,466,684283,475,0001,031,0002,113,536expected "2196919533 ", got "hh0wjh0wih0woh0wgh0wih0woh0whh0whh0whh0whh0wih0wih0wih0whh0wlh0whh0woh0weh0w7h0whh0wkh0wih0wbh0wih0wbh0wjh0wih0wih0whh0wah0wmh0wih0wgh0w7h0weh0wgh0wgh0whh0wgh0w "
3Oct 12, 2026 16:000310,210,919300,135,0001,067,0002,113,536expected "2108751264 ", got "bh0whh0w8h0wdh0wnh0whh0wdh0wgh0wjh0wjh0whh0wfh0wgh0wgh0whh0wih0wbh0wjh0wkh0whh0wih0weh0whh0woh0whh0woh0whh0wjh0wgh0whh0whh0wgh0whh0whh0whh0woh0wjh0wkh0wjh0wbh0w "