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 listJan 2, 2026 04:55Rajarshi BasuRajarshi BasuError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 5, 2026 21:26Andrew Epstein22.82CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 21:30058,594,85843,874,0004,125,00016,384No answer to stdout. Died or killed?
2Jan 2, 2026 04:557,01587,408,41850,463,0007,064,0002,449,408
3Jan 2, 2026 04:557,31788,053,12255,003,0005,000,0002,387,968
4Jan 2, 2026 04:557,39784,911,51054,593,0006,065,0002,285,568
5Jan 2, 2026 04:557,63887,458,51160,614,0002,020,0002,351,104
6Jan 2, 2026 04:558,02692,294,36863,792,0002,025,0002,338,816
7Jan 2, 2026 04:558,06690,496,07760,132,0006,013,0002,453,504
8Jan 2, 2026 04:558,550100,419,74865,102,0005,007,0002,416,640
9Jan 2, 2026 04:55106,712900,646,606757,170,000117,870,0002,473,984
10Jan 2, 2026 04:55117,610991,325,993840,477,000123,922,0002,490,368