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 3, 2026 18:18boop34boop34Score: 8,249Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 18:188,18277,858,17266,777,0001,138,0002,113,536
2Aug 3, 2026 18:188,22978,280,66567,065,0001,243,0002,113,536
3Aug 3, 2026 18:188,23178,174,73167,107,0001,213,0002,113,536
4Aug 3, 2026 18:188,24078,337,09967,200,0001,195,0002,113,536
5Aug 3, 2026 18:188,24978,410,32667,286,0001,184,0002,113,536
6Aug 3, 2026 18:188,25478,480,44867,285,0001,226,0002,113,536
7Aug 3, 2026 18:188,28378,655,55267,625,0001,129,0002,113,536
8Aug 3, 2026 18:188,29178,750,66267,615,0001,203,0002,113,536
9Aug 3, 2026 18:188,30878,853,43467,822,0001,136,0002,113,536