The paper gives a description of approaches to estimating speed properties of algorithms for summation and subtraction of integers with arbitrary length. Methods described are based on calculating the amount of operations performed during their processing. It makes it possible to determine the limits of applying long numbers as one-dimensional arrays in which each digit takes up one byte.