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 listApr 15, 2026 20:37zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 12:08Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:0808,773,7521,091,000020,480No answer to stdout. Died or killed?
2Apr 15, 2026 20:382,82242,508,59322,134,0001,006,0002,326,528
3Apr 15, 2026 20:382,84045,817,69221,266,0002,025,0002,379,776
4Apr 15, 2026 20:372,84148,941,74422,284,0001,012,0002,416,640
5Apr 15, 2026 20:372,84148,001,06823,300,00002,322,432
6Apr 15, 2026 20:382,86745,636,38922,489,0001,022,0002,363,392
7Apr 15, 2026 20:375,37770,680,09043,092,0001,002,0002,473,984