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 15:40Victor MerckléVictor MerckléScore: 2,632Success
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 15:412,62332,553,60720,462,0001,049,0002,117,632stderr
2Sep 7, 2026 15:412,62632,341,27620,473,0001,065,0002,117,632stderr
3Sep 7, 2026 15:412,62733,324,46020,516,0001,031,0002,117,632stderr
4Sep 7, 2026 15:412,62932,411,59920,536,0001,028,0002,117,632stderr
5Sep 7, 2026 15:412,63232,488,63920,557,0001,026,0002,117,632stderr
6Sep 7, 2026 15:415,35754,738,96942,912,0001,020,0002,117,632stderr
7Sep 7, 2026 15:415,35954,764,18342,925,0001,023,0002,117,632stderr
8Sep 7, 2026 15:415,37954,983,30343,089,0001,022,0002,117,632stderr
9Sep 7, 2026 15:415,38154,965,67743,106,0001,022,0002,117,632stderr