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 listMay 6, 2025 19:48Aniruddha DebAniruddha DebError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 5, 2026 21:17Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 21:180409,385,708372,016,00028,355,00020,480No answer to stdout. Died or killed?stderr
2May 6, 2025 19:4894,906802,568,984745,261,00032,967,0002,289,664
3May 6, 2025 19:4896,842818,259,097768,136,00025,970,0002,433,024
4May 6, 2025 19:48100,230849,489,490796,892,00024,996,0002,314,240
5May 6, 2025 19:48100,760849,512,638787,267,00038,963,0002,375,680
6May 6, 2025 19:48101,071857,440,709797,794,00030,992,0002,498,560
7May 6, 2025 19:48101,629857,439,456808,380,00024,980,0002,437,120
8May 6, 2025 19:48101,712861,630,160801,079,00032,962,0002,297,856
9May 6, 2025 19:48103,763874,370,328817,862,00032,994,0002,469,888
10May 6, 2025 19:48110,590931,984,572869,842,00036,993,0002,510,848