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 7, 2025 09:59Valentin KofmanValentin KofmanError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 5, 2026 21:26Andrew Epstein28.45CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 21:310128,033,475116,596,0001,011,00016,384No answer to stdout. Died or killed?
2Jul 7, 2025 09:5910,191109,478,81482,564,0001,006,0002,441,216
3Jul 7, 2025 09:5910,199110,133,03182,623,0001,007,0002,445,312
4Jul 7, 2025 09:5910,213109,720,54882,747,000996,0002,293,760
5Jul 7, 2025 09:5910,214116,789,58781,764,0001,994,0002,269,184
6Jul 7, 2025 09:5910,215110,835,62881,767,0001,994,0002,428,928
7Jul 7, 2025 09:5910,225106,895,49682,844,000998,0002,449,408
8Jul 7, 2025 09:5910,259105,412,74581,120,0003,004,0002,449,408
9Jul 7, 2025 09:5910,295110,936,43984,418,00002,265,088
10Jul 7, 2025 09:5910,356105,387,89181,920,0002,997,0002,273,280