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 listMay 10, 2026 18:19Josu San MartinJosu San MartinScore: 4,354Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 18:194,30745,358,01134,696,0001,059,0002,113,536
2May 10, 2026 18:194,30943,003,58734,732,0001,034,0002,113,536
3May 10, 2026 18:194,31043,113,83734,706,0001,067,0002,113,536
4May 10, 2026 18:194,33444,070,56534,917,0001,058,0002,113,536
5May 10, 2026 18:194,35444,495,04135,092,0001,051,0002,113,536
6May 10, 2026 18:194,35945,858,32535,075,0001,111,0002,113,536
7May 10, 2026 18:194,37945,846,18635,302,0001,049,0002,113,536
8May 10, 2026 18:194,40144,419,71135,459,0001,074,0002,113,536
9May 10, 2026 18:194,43046,269,54135,708,0001,065,0002,113,536