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 listMay 20, 2026 19:02M-RochatM-RochatError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 19:02037,921,85226,899,0001,042,0002,113,536expected "2309235954 ", got "2118071621 "
2May 20, 2026 19:02038,161,29227,230,0001,049,0002,113,536expected "2028865464 ", got "2118071621 "
3May 20, 2026 19:02038,057,48326,962,0001,043,0002,113,536expected "2143414618 ", got "2118071621 "