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 7, 2026 16:41Victor MerckléVictor MerckléScore: 2,601Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 16:442,59329,679,61421,268,000024,576stderr
2Sep 7, 2026 16:442,59929,725,41421,315,000024,576stderr
3Sep 7, 2026 16:442,59929,558,98921,312,000024,576stderr
4Sep 7, 2026 16:442,60129,677,41921,335,000024,576stderr
5Sep 7, 2026 16:442,60129,848,47721,333,000024,576stderr
6Sep 7, 2026 16:442,60229,806,56020,325,0001,019,00024,576stderr
7Sep 7, 2026 16:442,60529,712,51021,365,000024,576stderr
8Sep 7, 2026 16:442,64230,794,63220,647,0001,021,00024,576stderr
9Sep 7, 2026 16:445,42852,944,71043,501,0001,016,00024,576stderr