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 listMar 10, 2026 16:58caandocaandoScore: 5,089Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 16:585,05368,443,48539,943,0001,997,0002,285,568
2Mar 10, 2026 16:585,08272,602,23640,174,0002,008,0002,285,568
3Mar 10, 2026 16:585,08271,615,53440,175,0002,008,0002,285,568
4Mar 10, 2026 16:585,08965,010,98939,220,0003,016,0002,355,200
5Mar 10, 2026 16:585,09061,370,44740,236,0002,011,0002,285,568
6Mar 10, 2026 16:585,16168,515,50639,847,0002,988,0002,359,296