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 listMay 7, 2026 20:20Pavel SkripkinPavel SkripkinScore: 6,863Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 20:216,69568,283,98246,981,0007,919,0002,490,368
2May 7, 2026 20:216,72768,740,23647,296,0007,871,0002,560,000
3May 7, 2026 20:216,75070,639,28746,926,0008,424,0002,367,488
4May 7, 2026 20:216,82272,438,86547,504,0008,443,0002,490,368
5May 7, 2026 20:216,86372,945,35648,092,0008,187,0002,428,928
6May 7, 2026 20:216,89774,591,17747,985,0008,575,0002,527,232
7May 7, 2026 20:216,89772,233,75948,033,0008,530,0002,523,136
8May 7, 2026 20:216,92172,696,35748,320,0008,436,0002,424,832
9May 7, 2026 20:217,02071,491,11048,848,0008,717,0002,465,792