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 listJul 31, 2022 13:50Yuriy LyfenkoYuriy LyfenkoScore: 7,727Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2022 13:507,60988,772,60260,151,0003,007,0002,490,368
2Jul 31, 2022 13:507,656121,175,38063,543,41902,256,896
3Jul 31, 2022 13:507,69090,066,66958,845,0004,986,0002,277,376
4Jul 31, 2022 13:507,70085,618,17860,912,0002,995,0002,269,184
5Jul 31, 2022 13:507,72390,727,39061,096,0003,004,0002,330,624
6Jul 31, 2022 13:507,72792,468,00760,130,0004,008,0002,342,912
7Jul 31, 2022 13:507,72790,161,27062,127,0002,004,0002,482,176
8Jul 31, 2022 13:507,754131,456,49764,359,57002,306,048
9Jul 31, 2022 13:507,775133,153,16764,536,38602,306,048
10Jul 31, 2022 13:507,77588,475,65063,523,0001,008,0002,416,640
11Jul 31, 2022 13:507,77592,802,28860,503,0004,033,0002,260,992
12Jul 31, 2022 13:507,80595,581,06659,797,0004,983,0002,318,336