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 listApr 14, 2026 02:44Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 13:25Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 13:25036,869,39426,111,0001,021,0002,117,632expected "0 ", got "2147483648 "stderr
2Jul 5, 2026 13:25036,578,63525,938,0001,031,0002,117,632expected "0 ", got "2147483648 "stderr
3Jul 5, 2026 13:25036,624,84725,980,0001,026,0002,117,632expected "0 ", got "2147483648 "stderr
4Apr 14, 2026 02:443,64651,438,33527,905,0001,993,0002,297,856
5Apr 14, 2026 02:443,65655,653,94527,983,0001,998,0002,293,760
6Apr 14, 2026 02:443,67258,198,01827,100,0003,011,0002,416,640