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 6, 2023 02:44Yuriy LyfenkoYuriy LyfenkoScore: 8,015Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2023 02:447,84893,167,74062,131,0003,006,0002,486,272
2Dec 6, 2023 02:447,95389,732,78764,008,0002,000,0002,482,176
3Dec 6, 2023 02:447,970128,178,44866,148,41502,289,664
4Dec 6, 2023 02:447,97791,524,76063,201,0003,009,0002,306,048
5Dec 6, 2023 02:447,988124,445,52866,301,19702,281,472
6Dec 6, 2023 02:448,00996,221,74863,456,0003,021,0002,408,448
7Dec 6, 2023 02:448,01593,164,30862,491,0004,031,0002,273,280
8Dec 6, 2023 02:448,017136,439,75666,539,63102,281,472
9Dec 6, 2023 02:448,06391,098,18264,925,0001,997,0002,277,376
10Dec 6, 2023 02:448,13393,545,47664,485,0003,022,0002,420,736
11Dec 6, 2023 02:448,20399,321,42465,079,0003,003,0002,367,488
12Dec 6, 2023 02:448,28693,542,16963,790,0004,983,0002,379,776