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 listAug 30, 2026 21:50Josu San MartinJosu San MartinScore: 4,273Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 21:504,25343,720,22934,248,0001,059,0002,113,536
2Aug 30, 2026 21:504,25643,755,33934,293,0001,040,0002,113,536
3Aug 30, 2026 21:504,25743,840,38634,291,0001,047,0002,113,536
4Aug 30, 2026 21:504,26943,914,91034,384,0001,053,0002,113,536
5Aug 30, 2026 21:504,27343,974,09034,426,0001,048,0002,113,536
6Aug 30, 2026 21:504,28044,046,90734,495,0001,031,0002,113,536
7Aug 30, 2026 21:504,28244,046,93134,508,0001,033,0002,113,536
8Aug 30, 2026 21:504,29844,190,18434,641,0001,036,0002,113,536
9Aug 30, 2026 21:504,40344,994,42935,505,0001,040,0002,113,536