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 27, 2026 13:12Victor MerckléVictor MerckléScore: 3,214Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 13:133,12533,370,00224,439,0001,188,0002,113,536
2Jun 27, 2026 13:133,15933,593,86524,742,0001,169,0002,113,536
3Jun 27, 2026 13:133,15933,801,70124,745,0001,166,0002,113,536
4Jun 27, 2026 13:133,18134,022,99624,929,0001,156,0002,113,536
5Jun 27, 2026 13:133,21434,171,75825,186,0001,169,0002,113,536
6Jun 27, 2026 13:1312,040106,446,38797,724,0001,008,0002,113,536
7Jun 27, 2026 13:1312,113107,051,93398,325,0001,008,0002,113,536
8Jun 27, 2026 13:1312,128107,143,10898,443,0001,008,0002,113,536
9Jun 27, 2026 13:1312,526110,523,587101,708,0001,011,0002,113,536