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 16, 2026 15:50Maya RebholzMaya RebholzScore: 34,269Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 16, 2026 15:5133,464283,613,217223,170,00051,238,0002,281,472
2Jun 16, 2026 15:5133,723286,040,566225,280,00051,254,0002,281,472
3Jun 16, 2026 15:5133,742286,238,506225,809,00050,881,0002,281,472
4Jun 16, 2026 15:5133,820286,523,283222,889,00054,435,0002,281,472
5Jun 16, 2026 15:5134,269290,272,642225,864,00055,146,0002,281,472
6Jun 16, 2026 15:5134,416291,780,736230,500,00051,717,0002,281,472
7Jun 16, 2026 15:5134,510292,581,505232,089,00050,897,0002,281,472
8Jun 16, 2026 15:5135,510300,357,819236,436,00054,746,0002,281,472
9Jun 16, 2026 15:5135,945304,396,248241,553,00053,203,0002,281,472