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 listSep 6, 2026 10:05Kevin HeaveyKevin HeaveyScore: 3,664Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 10:063,54339,428,83828,270,0001,141,0002,113,536
2Sep 6, 2026 10:063,55239,478,00728,299,0001,187,0002,113,536
3Sep 6, 2026 10:063,55339,532,85428,359,0001,139,0002,113,536
4Sep 6, 2026 10:063,64640,304,43829,114,0001,154,0002,113,536
5Sep 6, 2026 10:063,66440,372,21429,230,0001,182,0002,113,536
6Sep 6, 2026 10:063,69140,689,51129,591,0001,045,0002,113,536
7Sep 6, 2026 10:063,78541,451,82530,250,0001,172,0002,113,536
8Sep 6, 2026 10:063,89843,070,16431,157,0001,203,0002,113,536
9Sep 6, 2026 10:063,91142,473,98431,304,0001,158,0002,113,536