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 9, 2026 08:33flavio87flavio87Score: 8,464Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 08:348,38386,145,88767,542,0002,045,0002,387,968
2May 9, 2026 08:348,41383,936,41167,801,0002,028,0002,363,392
3May 9, 2026 08:348,42385,307,41868,887,0001,031,0002,408,448
4May 9, 2026 08:348,46485,679,64369,235,0001,021,0002,383,872
5May 9, 2026 08:348,46485,428,78869,234,0001,021,0002,392,064
6May 9, 2026 08:348,48588,652,57968,407,0002,026,0002,371,584
7May 9, 2026 08:348,49486,885,83368,479,0002,029,0002,363,392
8May 9, 2026 08:348,50987,292,14368,582,0002,044,0002,359,296
9May 9, 2026 08:348,52582,718,43668,749,0002,013,0002,359,296