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 listJan 17, 2022 14:35Yuriy LyfenkoYuriy LyfenkoScore: 27,190Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2022 14:3527,163246,117,767223,446,0002,004,0002,478,080
2Jan 17, 2022 14:3527,176254,726,041223,553,0002,004,0002,473,984
3Jan 17, 2022 14:3527,176250,905,282223,555,0002,004,0002,543,616
4Jan 17, 2022 14:3527,177284,406,898225,566,71102,199,552
5Jan 17, 2022 14:3527,177254,442,514224,568,0001,002,0002,543,616
6Jan 17, 2022 14:3527,181251,313,785224,599,0001,002,0002,478,080
7Jan 17, 2022 14:3527,190297,113,598225,677,98202,195,456
8Jan 17, 2022 14:3527,199286,962,443225,755,41702,179,072
9Jan 17, 2022 14:3527,199257,692,468223,758,0001,997,0002,281,472
10Jan 17, 2022 14:3527,199255,861,270222,754,0002,996,0002,281,472
11Jan 17, 2022 14:3527,200258,228,629223,766,0001,997,0002,543,616
12Jan 17, 2022 14:3527,225254,613,492223,965,0001,999,0002,465,792