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 23, 2026 13:37Victor MerckléVictor MerckléScore: 12,041Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 13:383,20633,763,81625,235,0001,060,0002,113,536
2Jun 23, 2026 13:383,21433,835,91125,295,0001,064,0002,113,536
3Jun 23, 2026 13:383,22233,827,18625,352,0001,072,0002,113,536
4Jun 23, 2026 13:383,22933,951,33725,412,0001,066,0002,113,536
5Jun 23, 2026 13:3812,041106,172,14497,729,0001,015,0002,113,536
6Jun 23, 2026 13:3812,050106,263,59197,798,0001,014,0002,113,536
7Jun 23, 2026 13:3812,080106,476,92898,043,0001,015,0002,113,536
8Jun 23, 2026 13:3812,080106,576,82998,043,0001,014,0002,113,536
9Jun 23, 2026 13:3812,136106,920,84898,504,0001,015,0002,113,536