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 17:03Victor MerckléVictor MerckléScore: 3,151Success
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 17:043,05632,730,62723,871,0001,195,0002,113,536
2Jun 23, 2026 17:043,06132,813,90324,079,0001,022,0002,113,536
3Jun 23, 2026 17:043,11433,138,50024,512,0001,026,0002,113,536
4Jun 23, 2026 17:043,12833,265,36024,627,0001,026,0002,113,536
5Jun 23, 2026 17:043,15133,438,22424,815,0001,027,0002,113,536
6Jun 23, 2026 17:043,23034,158,88725,331,0001,157,0002,113,536
7Jun 23, 2026 17:0412,000106,113,80097,397,0001,008,0002,113,536
8Jun 23, 2026 17:0412,559110,706,768101,978,0001,008,0002,113,536
9Jun 23, 2026 17:0412,626111,097,159102,530,0001,007,0002,113,536