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 2, 2026 15:24caandocaandoScore: 5,447Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2026 15:245,36367,083,51543,501,0001,011,0002,285,568
2Mar 2, 2026 15:245,36970,037,18443,549,0001,012,0002,285,568
3Mar 2, 2026 15:245,37675,102,27044,619,00002,269,184
4Mar 2, 2026 15:245,44768,097,55643,204,0002,009,0002,338,816
5Mar 2, 2026 15:245,45667,282,25243,270,0002,012,0002,285,568
6Mar 2, 2026 15:245,46073,022,72743,307,0002,014,0002,285,568