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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 12:36Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:36033,147,38222,549,0001,173,0002,117,632expected "0 ", got "2147483648 "stderr
2Jul 5, 2026 12:36033,100,44022,461,0001,170,0002,117,632expected "0 ", got "2147483648 "stderr
3Jul 5, 2026 12:36033,142,64422,627,0001,176,0002,117,632expected "0 ", got "2147483648 "stderr
4Apr 14, 2026 04:123,29157,260,04124,989,0001,999,0002,334,720
5Apr 14, 2026 04:123,29654,365,03823,026,0004,004,0002,367,488
6Apr 14, 2026 04:123,30047,966,68724,055,0003,006,0002,306,048