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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 13:47Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 13:47033,195,03622,621,0001,170,0002,117,632expected "0 ", got "2147483648 "stderr
2Jul 5, 2026 13:47033,266,99222,646,0001,156,0002,117,632expected "0 ", got "2147483648 "stderr
3Jul 5, 2026 13:47033,109,57122,574,0001,158,0002,117,632expected "0 ", got "2147483648 "stderr
4Apr 14, 2026 03:303,67556,676,69325,115,0005,023,0002,510,848
5Apr 14, 2026 03:303,97860,986,15432,620,00002,289,664
6Apr 14, 2026 03:304,02759,295,95228,020,0005,003,0002,449,408