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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 13:27Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 13:27036,494,55625,853,0001,167,0002,117,632expected "0 ", got "2147483648 "stderr
2Jul 5, 2026 13:27036,291,75025,696,0001,158,0002,117,632expected "0 ", got "2147483648 "stderr
3Jul 5, 2026 13:27036,346,18125,775,0001,159,0002,117,632expected "0 ", got "2147483648 "stderr
4Apr 14, 2026 02:523,60350,073,04629,547,00002,510,848
5Apr 14, 2026 02:523,63960,969,31127,853,0001,989,0002,416,640
6Apr 14, 2026 02:523,64856,341,25327,920,0001,994,0002,314,240
7Apr 14, 2026 02:523,67253,088,92727,099,0003,011,0002,269,184
8Apr 14, 2026 02:523,68157,811,83027,164,0003,018,0002,310,144
9Apr 14, 2026 02:523,69055,815,31828,243,0002,017,0002,277,376