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:34highload-churnerhighload-churnerScore: 2,504Success
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:352,48629,432,29720,388,000020,480
2Oct 15, 2026 03:352,49029,412,48420,418,000020,480
3Oct 15, 2026 03:352,49329,367,89220,450,000020,480
4Oct 15, 2026 03:352,49429,479,57120,458,000020,480
5Oct 15, 2026 03:352,50429,535,37120,534,000020,480
6Oct 15, 2026 03:352,51329,512,22520,612,000020,480
7Oct 15, 2026 03:353,58638,425,46726,065,0003,343,00020,480
8Oct 15, 2026 03:354,09842,636,11430,438,0003,171,00020,480
9Oct 15, 2026 03:354,81748,554,80036,089,0003,413,00020,480