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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 13:30Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 13:30036,757,80626,057,0001,024,0002,117,632expected "0 ", got "2147483648 "stderr
2Jul 5, 2026 13:30036,717,41126,053,0001,024,0002,117,632expected "0 ", got "2147483648 "stderr
3Jul 5, 2026 13:30036,793,24226,139,0001,023,0002,117,632expected "0 ", got "2147483648 "stderr
4Apr 14, 2026 02:533,68552,852,07827,196,0003,021,0002,310,144
5Apr 14, 2026 02:533,68652,955,82227,206,0003,022,0002,465,792
6Apr 14, 2026 02:533,78756,197,00729,048,0002,003,0002,342,912