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 12, 2026 11:18Victor MerckléVictor MerckléScore: 3,351Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 11:193,30434,511,62926,057,0001,036,0002,113,536
2Jun 12, 2026 11:193,33634,943,38326,312,0001,048,0002,113,536
3Jun 12, 2026 11:193,34034,976,52726,350,0001,046,0002,113,536
4Jun 12, 2026 11:193,34234,782,76126,370,0001,042,0002,113,536
5Jun 12, 2026 11:193,35134,833,81626,436,0001,045,0002,113,536
6Jun 12, 2026 11:193,36035,115,39826,521,0001,039,0002,113,536
7Jun 12, 2026 11:193,37135,015,31226,592,0001,057,0002,113,536
8Jun 12, 2026 11:193,37335,217,62026,615,0001,050,0002,113,536
9Jun 12, 2026 11:1912,872112,920,802103,341,0002,210,0002,113,536