This paper is dedicated to the complexity comparison of adaptive binary arithmetic coding integer software implementations.
For binary memoryless sources with known probability distribution, we prove that encoding time for arithmetic encoder is a linear function of a number of input binary symbols and source entropy.