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 5, 2022 15:31Yuriy LyfenkoYuriy LyfenkoScore: 7,350Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 5, 2022 15:367,18087,044,99853,534,0006,060,0002,334,720
2Dec 5, 2022 15:367,20281,416,19656,785,0002,988,0002,326,528
3Dec 5, 2022 15:367,21091,833,60654,857,0004,987,0002,265,088
4Dec 5, 2022 15:367,28482,952,60555,421,0005,038,0002,416,640
5Dec 5, 2022 15:367,32693,075,50158,810,0001,993,0002,392,064
6Dec 5, 2022 15:367,33786,740,63157,903,0002,994,0002,342,912
7Dec 5, 2022 15:367,344129,961,04160,951,51502,248,704
8Dec 5, 2022 15:367,35083,891,08157,003,0004,000,0002,498,560
9Dec 5, 2022 15:317,354122,271,76861,036,47602,195,456
10Dec 5, 2022 15:367,359136,614,37661,080,98202,191,360
11Dec 5, 2022 15:367,381135,787,84161,261,33302,191,360
12Dec 5, 2022 15:317,414130,745,56061,539,99902,207,744
13Dec 5, 2022 15:317,481133,385,49462,088,99802,277,376
14Dec 5, 2022 15:367,90498,242,65463,582,0002,018,0002,461,696
15Dec 5, 2022 15:368,05994,861,88663,894,0002,995,0002,347,008