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 31, 2024 06:55GraceGraceScore: 8,015Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 31, 2024 06:557,998112,327,98166,380,09102,281,472
2May 31, 2024 06:558,002116,493,14166,420,44302,293,760
3May 31, 2024 06:558,008123,769,06666,467,45902,277,376
4May 31, 2024 06:558,008126,428,12066,468,54002,281,472
5May 31, 2024 06:558,015132,821,04666,524,90602,285,568
6May 31, 2024 06:558,031127,341,74366,657,08802,285,568
7May 31, 2024 06:558,034123,086,41266,681,16302,293,760
8May 31, 2024 06:558,058125,034,06566,882,10502,285,568
9May 31, 2024 06:558,214125,538,23968,175,45402,285,568