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 27, 2026 13:28Victor MerckléVictor MerckléScore: 12,081Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 13:293,09533,257,77824,242,0001,137,0002,113,536
2Jun 27, 2026 13:293,13933,472,86224,560,0001,183,0002,113,536
3Jun 27, 2026 13:293,15233,648,55824,689,0001,162,0002,113,536
4Jun 27, 2026 13:2911,999106,180,29097,388,0001,007,0002,113,536
5Jun 27, 2026 13:2912,081106,937,72998,061,0001,008,0002,113,536
6Jun 27, 2026 13:2912,111107,014,80298,311,0001,007,0002,113,536
7Jun 27, 2026 13:2912,120107,197,66398,377,0001,008,0002,113,536
8Jun 27, 2026 13:2912,157107,514,82898,682,0001,010,0002,113,536
9Jun 27, 2026 13:2912,269108,521,46399,593,0001,018,0002,113,536