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 6, 2025 09:51Aniruddha DebAniruddha DebError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 5, 2026 21:19Andrew Epstein13.61CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 21:21020,033,755,35919,855,638,000168,794,00020,480Killed by timeoutstderr
2Jul 6, 2025 09:516,10373,787,03949,044,0001,000,0002,502,656
3Jul 6, 2025 09:516,17375,764,08450,617,00002,490,368
4Jul 6, 2025 09:516,20573,001,06349,884,000997,0002,334,720
5Jul 6, 2025 09:516,21276,644,48349,941,000998,0002,457,600
6Jul 6, 2025 09:516,25672,894,01151,303,00002,433,024
7Jul 6, 2025 09:516,31974,698,26650,818,000996,0002,506,752
8Jul 6, 2025 09:516,41176,245,51552,569,00002,322,432
9Jul 6, 2025 09:516,49971,792,65452,286,0001,005,0002,445,312
10Jul 6, 2025 09:516,50173,773,86353,305,00002,531,328