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 listOct 16, 2026 22:35janwwwjanwwwScore: 3,038Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 29, 2026 22:12Andrew Epstein10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 22:383,01733,606,47023,712,0001,033,0002,113,536
2Oct 16, 2026 22:383,02933,511,77223,810,0001,034,0002,113,536
3Oct 16, 2026 22:383,03233,674,88323,819,0001,050,0002,113,536
4Oct 16, 2026 22:383,03633,849,98323,863,0001,036,0002,113,536
5Oct 16, 2026 22:383,03834,112,89723,880,0001,034,0002,113,536
6Oct 16, 2026 22:383,03833,887,99423,870,0001,048,0002,117,632
7Oct 16, 2026 22:383,03933,789,07523,889,0001,035,0002,113,536
8Oct 16, 2026 22:383,05033,858,15923,963,0001,054,0002,113,536
9Oct 16, 2026 22:383,05633,819,11624,022,0001,040,0002,113,536