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 28, 2022 10:54Jack FrigaardJack FrigaardScore: 5,871Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2022 10:545,851105,265,42448,560,42702,174,976
2Dec 28, 2022 10:555,851124,662,52548,560,75202,306,048
3Dec 28, 2022 10:585,851129,847,97248,559,87302,285,568
4Dec 28, 2022 10:555,868113,646,71348,705,57502,174,976
5Dec 28, 2022 10:585,871104,378,78448,726,84802,301,952
6Dec 28, 2022 10:545,906111,473,02249,020,48202,289,664
7Dec 28, 2022 10:585,907111,402,03049,024,09602,179,072
8Dec 28, 2022 10:555,924122,539,23449,170,19002,293,760
9Dec 28, 2022 10:545,980118,222,91649,637,53102,252,800