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 2, 2026 12:37Pavel SkripkinPavel SkripkinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 2, 2026 12:37089,819,40072,002,0003,000,0002,400,256expected "2053420200 ", got " "
2May 2, 2026 12:37087,113,55569,728,0003,984,0002,392,064expected "2219112244 ", got " "
3May 2, 2026 12:37093,567,47070,228,0004,013,0002,514,944expected "2122043064 ", got " "