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:11Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 13:19Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 13:19036,140,10425,613,0001,118,0002,117,632expected "0 ", got "2147483648 "stderr
2Jul 5, 2026 13:19036,067,14625,513,0001,087,0002,117,632expected "0 ", got "2147483648 "stderr
3Jul 5, 2026 13:19036,070,97325,496,0001,151,0002,117,632expected "0 ", got "2147483648 "stderr
4Apr 14, 2026 02:113,54955,419,85127,094,0002,007,0002,465,792
5Apr 14, 2026 02:113,61755,235,32428,637,0001,022,0002,400,256
6Apr 14, 2026 02:113,65954,877,97529,003,0001,000,0002,297,856