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 listSep 12, 2022 04:03Yuriy LyfenkoYuriy LyfenkoScore: 7,237Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2022 04:037,12882,377,87556,152,0003,008,0002,461,696
2Sep 12, 2022 04:037,13580,748,25156,209,0003,011,0002,494,464
3Sep 12, 2022 04:037,17287,021,00255,489,0004,035,0002,297,856
4Sep 12, 2022 04:037,17287,016,22554,485,0005,044,0002,334,720
5Sep 12, 2022 04:037,17685,326,79055,524,0004,038,0002,510,848
6Sep 12, 2022 04:037,20586,560,44456,814,0002,990,0002,326,528
7Sep 12, 2022 04:037,237130,245,35660,069,79102,269,184
8Sep 12, 2022 04:037,23887,882,56259,077,0001,001,0002,473,984
9Sep 12, 2022 04:037,25492,791,24756,198,0004,014,0002,510,848
10Sep 12, 2022 04:037,27381,426,26253,325,0007,042,0002,408,448
11Sep 12, 2022 04:037,277123,469,25360,402,79102,195,456
12Sep 12, 2022 04:037,285120,317,15360,466,73602,260,992