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 listJun 5, 2026 03:43Victor MerckléVictor MerckléScore: 3,548Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 03:443,36936,715,18326,564,0001,062,0002,113,536
2Jun 5, 2026 03:443,38736,840,14226,740,0001,035,0002,113,536
3Jun 5, 2026 03:443,38936,866,08726,742,0001,054,0002,113,536
4Jun 5, 2026 03:443,43337,301,36426,093,0002,062,0002,113,536
5Jun 5, 2026 03:443,54838,212,94328,049,0001,050,0002,113,536
6Jun 5, 2026 03:443,62838,823,81127,707,0002,049,0002,113,536
7Jun 5, 2026 03:443,87141,266,61029,441,0002,307,0002,113,536
8Jun 5, 2026 03:4412,959115,385,388104,242,0002,023,0002,113,536
9Jun 5, 2026 03:4413,725121,649,753110,517,0002,035,0002,113,536