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 21, 2026 11:01Victor MerckléVictor MerckléScore: 3,443Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 11:023,32234,848,09726,181,0001,067,0002,113,536
2Jun 21, 2026 11:023,34935,055,49826,401,0001,063,0002,113,536
3Jun 21, 2026 11:023,38236,753,37726,708,0001,031,0002,113,536
4Jun 21, 2026 11:023,38335,362,72826,677,0001,070,0002,113,536
5Jun 21, 2026 11:023,44335,902,51027,200,0001,034,0002,113,536
6Jun 21, 2026 11:023,44436,004,62426,021,0002,221,0002,113,536
7Jun 21, 2026 11:023,44735,877,14427,228,0001,045,0002,113,536
8Jun 21, 2026 11:026,55261,350,07952,704,0001,024,0002,113,536
9Jun 21, 2026 11:0213,026114,808,120104,791,0002,025,0002,113,536