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 1, 2026 15:06Mehdi-Dehghan-FooladiMehdi-Dehghan-FooladiError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 15:0607,046,254,3556,899,279,000125,913,0002,527,232expected "2174818147 ", got "2174818122 "
2May 1, 2026 15:0607,315,746,7157,169,054,000124,913,0002,301,952expected "2208924388 ", got "2208924360 "
3May 1, 2026 15:0607,215,916,2837,057,297,000133,929,0002,519,040expected "2206990591 ", got "2206990527 "