Earlier quoted context omitted.
The number n has log(n)/log(10) digits so it technically take log(n) time to read it.
only if log(n) > 7. Otherwise, subitization gives constant time reading of the magnitude of n.
Technically, O(log(n) <= 7 ? 1 : log(n)) is still O(log(n)) ... :)