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 8, 2026 16:10Victor MerckléVictor MerckléScore: 6,321Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 16:113,24535,691,79025,325,0001,284,0002,113,536
2Jun 8, 2026 16:113,27836,453,95525,854,0001,029,0002,113,536
3Jun 8, 2026 16:113,53540,360,74326,918,0002,072,0002,113,536
4Jun 8, 2026 16:116,31760,914,99549,658,0002,148,0002,113,536
5Jun 8, 2026 16:116,32160,958,10549,737,0002,103,0002,113,536
6Jun 8, 2026 16:116,36361,263,70849,975,0002,204,0002,113,536
7Jun 8, 2026 16:116,39361,545,14950,162,0002,265,0002,113,536
8Jun 8, 2026 16:116,42561,806,09750,444,0002,245,0002,113,536
9Jun 8, 2026 16:116,56962,990,85951,806,0002,061,0002,113,536