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 11:57highload-churnerhighload-churnerScore: 35,726Success
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 11:5735,631301,285,294290,751,0001,424,00028,672stderr
2Oct 13, 2026 11:5735,638301,282,490290,817,0001,421,00028,672stderr
3Oct 13, 2026 11:5735,640301,234,413290,840,0001,409,00028,672stderr
4Oct 13, 2026 11:5735,715301,872,120291,446,0001,422,00028,672stderr
5Oct 13, 2026 11:5735,726301,962,853291,468,0001,490,00028,672stderr
6Oct 13, 2026 11:5735,726301,946,493291,519,0001,437,00028,672stderr
7Oct 13, 2026 11:5735,747302,141,172291,697,0001,436,00028,672stderr
8Oct 13, 2026 11:5735,814302,703,088292,195,0001,487,00028,672stderr
9Oct 13, 2026 11:57144,7071,195,636,0921,185,039,0001,560,00024,576stderr