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 22, 2026 02:29Victor MerckléVictor MerckléScore: 3,401Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 02:303,34235,187,18426,345,0001,060,0002,113,536
2Jun 22, 2026 02:303,34835,080,04926,402,0001,052,0002,113,536
3Jun 22, 2026 02:303,35935,099,27926,491,0001,053,0002,113,536
4Jun 22, 2026 02:303,38835,529,92326,749,0001,037,0002,113,536
5Jun 22, 2026 02:303,40135,348,72026,852,0001,044,0002,113,536
6Jun 22, 2026 02:303,44035,822,24927,166,0001,050,0002,113,536
7Jun 22, 2026 02:303,44635,647,87927,194,0001,068,0002,113,536
8Jun 22, 2026 02:303,50738,167,20327,727,0001,032,0002,113,536
9Jun 22, 2026 02:306,49760,892,74652,256,0001,021,0002,113,536