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 7, 2026 15:37Victor MerckléVictor MerckléScore: 5,112Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 15:384,97049,919,77837,369,0003,391,0002,113,536
2Jun 7, 2026 15:385,00950,168,57237,498,0003,582,0002,113,536
3Jun 7, 2026 15:385,06950,728,14838,006,0003,565,0002,113,536
4Jun 7, 2026 15:385,09359,786,11838,226,0003,543,0002,113,536
5Jun 7, 2026 15:385,11251,035,86138,377,0003,542,0002,113,536
6Jun 7, 2026 15:385,11351,076,39538,342,0003,587,0002,113,536
7Jun 7, 2026 15:385,12651,085,45938,948,0003,092,0002,113,536
8Jun 7, 2026 15:385,15151,375,44638,738,0003,501,0002,113,536
9Jun 7, 2026 15:385,48354,103,92640,817,0004,144,0002,113,536