The article consists aprouches to the speed avaluation of algorithms for the multiply and division operations for integer numbers with an arbitrarity dimensions on the base of the long number form as one dimensions massif where each digit ocupied one byte.