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 23:59Victor MerckléVictor MerckléScore: 12,025Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 00:003,03033,832,52723,642,0001,206,0002,113,536
2Jun 24, 2026 00:003,05832,790,66523,870,0001,208,0002,113,536
3Jun 24, 2026 00:0011,962105,934,15097,080,0001,009,0002,113,536
4Jun 24, 2026 00:0012,011105,898,99197,486,0001,008,0002,113,536
5Jun 24, 2026 00:0012,025106,287,66997,601,0001,009,0002,113,536
6Jun 24, 2026 00:0012,239108,064,88699,357,0001,009,0002,113,536
7Jun 24, 2026 00:0012,627111,226,119102,534,0001,009,0002,113,536
8Jun 24, 2026 00:0012,634111,599,241102,589,0001,012,0002,113,536
9Jun 24, 2026 00:0012,730112,017,621103,386,0001,007,0002,113,536