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 14, 2026 14:21marko1597marko1597Score: 6,211Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 14:286,19961,485,10850,313,0001,145,0002,113,536
2Aug 14, 2026 14:286,20261,493,60350,328,0001,150,0002,113,536
3Aug 14, 2026 14:286,20461,605,64450,351,0001,145,0002,113,536
4Aug 14, 2026 14:286,20761,551,57050,378,0001,146,0002,113,536
5Aug 14, 2026 14:286,21161,558,42950,391,0001,161,0002,113,536
6Aug 14, 2026 14:286,21661,596,14950,465,0001,133,0002,113,536
7Aug 14, 2026 14:286,22461,707,26950,455,0001,205,0002,113,536
8Aug 14, 2026 14:286,22562,485,75150,408,0001,262,0002,113,536
9Aug 14, 2026 14:286,22661,894,25250,452,0001,231,0002,113,536