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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 12:53Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:53033,461,84022,825,0001,174,0002,117,632expected "0 ", got "2147483648 "stderr
2Jul 5, 2026 12:53033,327,72622,750,0001,164,0002,117,632expected "0 ", got "2147483648 "stderr
3Jul 5, 2026 12:53033,288,87322,709,0001,163,0002,117,632expected "0 ", got "2147483648 "stderr
4Apr 14, 2026 03:223,45159,791,60526,279,0002,021,0002,359,296
5Apr 14, 2026 03:223,50156,920,95527,684,0001,025,0002,400,256
6Apr 14, 2026 03:223,52656,551,81525,920,0002,990,0002,482,176