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 listOct 23, 2025 19:22caandocaandoScore: 5,903Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 23, 2025 19:225,87982,837,78347,800,000995,0002,285,568
2Oct 23, 2025 19:225,88374,555,36746,834,0001,992,0002,285,568
3Oct 23, 2025 19:225,88469,836,37246,842,0001,993,0002,285,568
4Oct 23, 2025 19:225,88571,793,48247,849,000996,0002,285,568
5Oct 23, 2025 19:225,88774,462,47646,864,0001,994,0002,285,568
6Oct 23, 2025 19:225,90374,372,64346,995,0001,999,0002,531,328
7Oct 23, 2025 19:225,90370,356,64846,992,0001,999,0002,269,184
8Oct 23, 2025 19:225,90974,840,65248,046,0001,000,0002,285,568
9Oct 23, 2025 19:225,91277,240,13347,070,0002,003,0002,285,568
10Oct 23, 2025 19:226,02773,674,56649,020,0001,000,0002,285,568
11Oct 23, 2025 19:226,03773,014,06348,102,0002,004,0002,285,568
12Oct 23, 2025 19:226,06271,336,56448,304,0002,012,0002,285,568