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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 13:25Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 13:25035,820,12525,181,0001,210,0002,117,632expected "0 ", got "2147483648 "stderr
2Jul 5, 2026 13:25035,732,40625,211,0001,087,0002,117,632expected "0 ", got "2147483648 "stderr
3Jul 5, 2026 13:25035,763,97225,247,0001,070,0002,117,632expected "0 ", got "2147483648 "stderr
4Apr 14, 2026 02:293,60351,516,43825,471,0004,075,0002,351,104
5Apr 14, 2026 02:293,66653,314,88127,053,0003,005,0002,281,472
6Apr 14, 2026 02:293,67050,402,43328,091,0002,006,0002,392,064