Reading numbers in 0.1 seconds

Read as many numbers as possible within 0.1 seconds. Read every natural number in the input, then print how many you read and their sum. Reading one line at a time with a slow routine misses the time limit, so pick the fastest input method your language provides.

The first line contains the count of numbers $N$. ($1 \le N \le 5\,000\,000$)

Each of the next $N$ lines contains one natural number. Every number given is at most $10\,000\,000$.

Print the count $M$ of natural numbers you read on the first line, and their sum on the second line. The sum can exceed the range of a 32-bit integer.