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 listDec 25, 2024 03:29Joad NacerJoad NacerError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 13:40Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 13:40032,398,13923,525,0001,110,00016,384No answer to stdout. Died or killed?
2Dec 25, 2024 03:293,88463,184,13531,852,00002,396,160
3Dec 25, 2024 03:293,91053,445,03030,058,0002,003,0002,400,256
4Dec 25, 2024 03:293,96055,860,19432,468,00002,510,848