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:28Victor MerckléVictor MerckléScore: 3,642Success
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:293,59337,212,81824,503,0004,960,0002,113,536
2Jun 12, 2026 11:293,60237,406,59824,633,0004,909,0002,113,536
3Jun 12, 2026 11:293,60336,944,76824,848,0004,697,0002,113,536
4Jun 12, 2026 11:293,62337,415,17424,825,0004,884,0002,113,536
5Jun 12, 2026 11:293,64237,389,15325,036,0004,831,0002,113,536
6Jun 12, 2026 11:293,64637,406,82425,192,0004,711,0002,113,536
7Jun 12, 2026 11:293,65737,565,93824,792,0005,197,0002,113,536
8Jun 12, 2026 11:293,76538,295,18925,959,0004,919,0002,113,536
9Jun 12, 2026 11:2913,170115,585,796102,349,0005,652,0002,113,536