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:13Victor MerckléVictor MerckléScore: 3,115Success
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:143,07833,145,02424,030,0001,211,0002,113,536
2Jun 23, 2026 17:143,09333,005,55424,343,0001,026,0002,113,536
3Jun 23, 2026 17:143,10334,346,10324,236,0001,213,0002,113,536
4Jun 23, 2026 17:143,10733,510,00424,270,0001,210,0002,113,536
5Jun 23, 2026 17:143,11533,157,63024,350,0001,201,0002,113,536
6Jun 23, 2026 17:143,21534,064,88025,158,0001,208,0002,113,536
7Jun 23, 2026 17:1412,093106,831,19498,160,0001,010,0002,113,536
8Jun 23, 2026 17:1412,419109,492,711100,824,0001,015,0002,113,536
9Jun 23, 2026 17:1412,598111,021,339102,301,0001,009,0002,113,536