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 listJul 9, 2023 17:48gchebanovgchebanovScore: 12,394Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2023 17:4811,559177,983,97595,935,57202,269,184
2Jul 9, 2023 17:4811,563166,907,83295,974,62502,265,088
3Jul 9, 2023 17:4811,565156,541,15195,988,63102,269,184
4Jul 9, 2023 17:4812,334133,716,313102,373,00002,281,472
5Jul 9, 2023 17:4812,357128,762,970102,559,00002,514,944
6Jul 9, 2023 17:4812,357124,775,773101,560,0001,005,0002,281,472
7Jul 9, 2023 17:4812,394123,895,270100,870,0001,997,0002,519,040
8Jul 9, 2023 17:4812,398130,367,474101,902,000999,0002,281,472
9Jul 9, 2023 17:4812,401126,602,940100,934,0001,998,0002,514,944
10Jul 9, 2023 17:4812,403132,420,417101,945,000999,0002,281,472
11Jul 9, 2023 17:4812,482130,498,670102,594,0001,005,0002,281,472
12Jul 9, 2023 17:4812,799136,439,459104,231,0002,004,0002,281,472