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 19, 2026 16:13Milo PresedoMilo PresedoScore: 8,001Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 16:137,97974,652,35665,045,0001,186,0002,113,536
2May 19, 2026 16:137,98074,545,46665,072,0001,170,0002,113,536
3May 19, 2026 16:137,99679,360,61665,158,0001,211,0002,113,536
4May 19, 2026 16:138,00077,199,23065,163,0001,239,0002,113,536
5May 19, 2026 16:138,00175,622,16665,211,0001,202,0002,113,536
6May 19, 2026 16:138,00177,129,42165,189,0001,226,0002,113,536
7May 19, 2026 16:138,00476,057,30165,236,0001,198,0002,113,536
8May 19, 2026 16:138,00575,908,81765,229,0001,215,0002,113,536
9May 19, 2026 16:138,01174,783,33465,270,0001,226,0002,113,536