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 04:36highload-churnerhighload-churnerScore: 24,058Success
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 04:3723,966205,477,494191,391,0005,136,00024,576stderr
2Oct 15, 2026 04:3723,970206,920,191191,353,0005,202,00024,576stderr
3Oct 15, 2026 04:3724,032206,023,424191,908,0005,159,00024,576stderr
4Oct 15, 2026 04:3724,040206,084,156191,940,0005,195,00024,576stderr
5Oct 15, 2026 04:3724,058206,215,077192,073,0005,205,00024,576stderr
6Oct 15, 2026 04:3724,102206,784,741192,314,0005,326,00024,576stderr
7Oct 15, 2026 04:3753,678449,236,211412,836,00027,329,00028,672stderr
8Oct 15, 2026 04:3753,890450,932,569413,957,00027,949,00028,672stderr
9Oct 15, 2026 04:3755,159461,326,653421,375,00030,932,00028,672stderr