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 listApr 16, 2026 21:46Josu San MartinJosu San MartinScore: 5,740Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2026 21:465,73173,840,75644,530,0003,036,0002,494,464
2Apr 16, 2026 21:465,74072,148,29045,613,0002,027,0002,453,504
3Apr 16, 2026 21:465,77173,417,85943,906,0003,991,0002,416,640