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 13:38highload-churnerhighload-churnerScore: 79,812Success
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 13:3977,057641,020,438615,631,00016,242,00032,768stderr
2Oct 13, 2026 13:3977,368643,447,223617,795,00016,628,00032,768stderr
3Oct 13, 2026 13:3977,570645,119,234614,738,00021,338,00032,768stderr
4Oct 13, 2026 13:3979,482660,751,799635,652,00016,101,00032,768stderr
5Oct 13, 2026 13:3979,812664,786,143636,399,00018,066,00032,768stderr
6Oct 13, 2026 13:3980,684670,540,368643,207,00018,407,00032,768stderr
7Oct 13, 2026 13:3980,910672,317,268643,858,00019,611,00032,768stderr
8Oct 13, 2026 13:3997,371807,442,407751,271,00047,173,00028,672stderr
9Oct 13, 2026 13:39119,977992,838,003933,420,00050,398,00032,768stderr