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 listDec 2, 2023 20:09Yuriy LyfenkoYuriy LyfenkoScore: 79,486Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 2, 2023 20:0979,464735,169,556659,550,99402,244,608
2Dec 2, 2023 20:0979,486719,446,844659,730,75902,363,392
3Dec 2, 2023 20:09120,6561,064,109,4441,001,446,85202,236,416