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 25, 2026 07:50limanjun99limanjun99Error
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 5, 2026 21:07Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 21:17017,606,8311,195,0005,497,00020,480No answer to stdout. Died or killed?
2Apr 25, 2026 07:514,13451,722,46630,912,0002,991,0002,351,104
3Apr 25, 2026 07:514,16050,873,18031,110,0003,010,0002,351,104
4Apr 25, 2026 07:514,17548,990,05031,218,0003,021,0002,342,912
5Apr 25, 2026 07:514,19053,526,95232,343,0002,021,0002,355,200
6Apr 25, 2026 07:514,19549,919,51330,352,0004,047,0002,420,736
7Apr 25, 2026 07:514,19558,809,98832,383,0002,023,0002,355,200
8Apr 25, 2026 07:514,19953,061,69633,427,0001,012,0002,486,272
9Apr 25, 2026 07:514,22754,566,20231,609,0003,059,0002,347,008
10Apr 25, 2026 07:514,22755,873,12231,607,0003,058,0002,351,104