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 listNov 25, 2023 20:19mmalczakmmalczakScore: 148,949Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 25, 2023 20:19145,4401,244,078,4251,192,603,97802,301,952
2Nov 25, 2023 20:19148,9491,279,707,1951,221,384,19502,183,168
3Nov 25, 2023 20:19151,6011,309,259,8171,243,129,05602,174,976