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 listJul 1, 2025 20:53Adam FolwarcznyAdam FolwarcznyError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 5, 2026 21:27Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 21:340130,769,824106,674,00012,904,00024,576No answer to stdout. Died or killed?stderr
2Jul 1, 2025 20:5323,252213,314,896165,713,00024,956,0002,297,856
3Jul 1, 2025 20:5324,134220,856,969180,910,00016,991,0002,318,336
4Jul 1, 2025 20:5324,615224,301,767182,862,00018,985,0002,310,144
5Jul 1, 2025 20:5325,473232,511,216191,891,00016,990,0002,445,312
6Jul 1, 2025 20:5329,349266,169,488219,688,00020,970,0002,277,376
7Jul 1, 2025 20:5332,640293,323,031241,684,00025,966,0002,416,640
8Jul 1, 2025 20:5332,919293,791,015250,942,00018,995,0002,494,464
9Jul 1, 2025 20:5333,710308,755,088255,393,00021,032,0002,465,792
10Jul 1, 2025 20:5336,538327,416,865278,641,00020,973,0002,396,160