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 23:43Victor MerckléVictor MerckléScore: 3,099Success
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 23:443,04032,567,95823,731,0001,200,0002,113,536
2Jun 23, 2026 23:443,09333,136,82824,158,0001,212,0002,113,536
3Jun 23, 2026 23:443,09432,989,14624,243,0001,128,0002,113,536
4Jun 23, 2026 23:443,09833,042,99524,205,0001,199,0002,113,536
5Jun 23, 2026 23:443,09933,048,57424,211,0001,201,0002,113,536
6Jun 23, 2026 23:4412,003106,001,84797,419,0001,010,0002,113,536
7Jun 23, 2026 23:4412,086106,723,60098,098,0001,010,0002,113,536
8Jun 23, 2026 23:4412,133107,094,17398,489,0001,008,0002,113,536
9Jun 23, 2026 23:4412,590110,859,523102,225,0001,013,0002,113,536