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 listSep 8, 2026 07:21Victor MerckléVictor MerckléScore: 2,599Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 07:222,58329,548,30021,183,000024,576stderr
2Sep 8, 2026 07:222,58630,381,05521,207,000024,576stderr
3Sep 8, 2026 07:222,58929,511,73221,237,000024,576stderr
4Sep 8, 2026 07:222,59929,537,28821,317,000024,576stderr
5Sep 8, 2026 07:222,59929,696,84421,316,000024,576stderr
6Sep 8, 2026 07:222,60230,491,43521,339,000024,576stderr
7Sep 8, 2026 07:225,31051,756,62442,533,0001,013,00024,576stderr
8Sep 8, 2026 07:225,33552,016,38442,737,0001,013,00024,576stderr
9Sep 8, 2026 07:225,35853,150,11042,928,0001,015,00024,576stderr