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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 02:283,14533,760,47224,595,0001,196,0002,113,536
2Jun 28, 2026 02:283,17033,908,90524,963,0001,038,0002,113,536
3Jun 28, 2026 02:283,17334,026,81724,791,0001,235,0002,113,536
4Jun 28, 2026 02:283,21035,201,68525,028,0001,298,0002,113,536
5Jun 28, 2026 02:2812,071106,980,73897,975,0001,010,0002,113,536
6Jun 28, 2026 02:2812,156107,653,64898,674,0001,007,0002,113,536
7Jun 28, 2026 02:2812,248108,400,22399,428,0001,008,0002,113,536
8Jun 28, 2026 02:2812,256108,489,23699,495,0001,007,0002,113,536
9Jun 28, 2026 02:2812,353109,239,866100,292,0001,008,0002,113,536