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 22:36mmalczakmmalczakScore: 91,165Success
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 22:3689,478801,702,026733,721,85202,170,880
2Nov 25, 2023 22:3691,165813,614,180747,551,12102,191,360
3Nov 25, 2023 22:3697,168861,573,744796,777,66802,187,264