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 19, 2026 17:44Victor MerckléVictor MerckléScore: 3,464Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 17:453,31134,554,62926,120,0001,037,0002,113,536
2Jun 19, 2026 17:453,37535,646,64826,619,0001,062,0002,113,536
3Jun 19, 2026 17:453,45335,983,34927,290,0001,031,0002,113,536
4Jun 19, 2026 17:453,45335,733,67827,285,0001,033,0002,113,536
5Jun 19, 2026 17:453,46436,113,54027,377,0001,029,0002,113,536
6Jun 19, 2026 17:453,50036,566,01527,655,0001,045,0002,113,536
7Jun 19, 2026 17:456,21458,353,13249,936,0001,022,0002,113,536
8Jun 19, 2026 17:456,23358,566,90850,091,0001,024,0002,113,536
9Jun 19, 2026 17:456,50860,766,13852,350,0001,022,0002,113,536