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 22:09Victor MerckléVictor MerckléScore: 3,129Success
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 22:103,06732,747,47523,943,0001,207,0002,113,536
2Jun 23, 2026 22:103,07532,801,75524,109,0001,114,0002,113,536
3Jun 23, 2026 22:103,09032,989,22324,246,0001,098,0002,113,536
4Jun 23, 2026 22:103,12333,652,77224,400,0001,211,0002,113,536
5Jun 23, 2026 22:103,12934,900,81224,636,0001,026,0002,113,536
6Jun 23, 2026 22:1011,955105,776,67497,029,0001,008,0002,113,536
7Jun 23, 2026 22:1011,956105,734,08797,035,0001,008,0002,113,536
8Jun 23, 2026 22:1012,069106,614,49397,962,0001,010,0002,113,536
9Jun 23, 2026 22:1012,556110,569,543101,953,0001,009,0002,113,536