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 16, 2026 16:01flavio87flavio87Score: 5,934Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 16:015,87758,021,62547,755,0001,026,0002,113,536
2May 16, 2026 16:015,88658,262,80247,827,0001,029,0002,113,536
3May 16, 2026 16:015,89256,233,00647,874,0001,034,0002,113,536
4May 16, 2026 16:015,93157,283,67748,213,0001,018,0002,113,536
5May 16, 2026 16:015,93457,114,89648,227,0001,029,0002,113,536
6May 16, 2026 16:015,94956,691,27348,360,0001,018,0002,113,536
7May 16, 2026 16:015,97159,840,21748,544,0001,018,0002,113,536
8May 16, 2026 16:015,98856,994,53948,686,0001,019,0002,113,536
9May 16, 2026 16:016,16659,394,92750,165,0001,018,0002,113,536