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 25, 2026 06:16limanjun99limanjun99Error
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 5, 2026 21:17Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 21:20012,160,98401,757,00020,480No answer to stdout. Died or killed?
2Apr 25, 2026 06:1732,969288,468,705269,347,0001,001,0002,478,080
3Apr 25, 2026 06:1733,104289,397,768267,463,0003,991,0002,531,328
4Apr 25, 2026 06:1733,498292,967,671270,695,0003,995,0002,478,080
5Apr 25, 2026 06:1734,531302,322,471280,155,0003,001,0002,338,816
6Apr 25, 2026 06:1734,605298,643,517280,771,0002,997,0002,506,752
7Apr 25, 2026 06:1734,958304,979,843282,662,0003,995,0002,519,040
8Apr 25, 2026 06:1735,138302,529,776285,132,0003,001,0002,301,952
9Apr 25, 2026 06:1735,605311,423,833289,970,0001,999,0002,543,616
10Apr 25, 2026 06:1736,066314,942,654291,751,0003,996,0002,342,912