Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listMay 21, 2026 10:17Victor MerckléVictor MerckléScore: 25,361Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 10:1825,337218,863,312209,252,0001,048,0002,113,536
2May 21, 2026 10:1825,339220,265,769209,232,0001,084,0002,113,536
3May 21, 2026 10:1825,349218,876,611209,337,0001,060,0002,113,536
4May 21, 2026 10:1825,360220,280,914209,444,0001,047,0002,113,536
5May 21, 2026 10:1825,361219,650,501209,478,0001,019,0002,113,536
6May 21, 2026 10:1825,362218,667,860209,476,0001,032,0002,113,536
7May 21, 2026 10:1825,379218,817,329209,627,0001,021,0002,113,536
8May 21, 2026 10:1825,414220,112,523209,941,0001,002,0002,113,536
9May 21, 2026 10:1825,463219,170,205210,294,0001,057,0002,113,536