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 listJan 29, 2022 22:24evgenikwtevgenikwtScore: 28,042Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2022 22:2427,531291,297,646228,503,65702,248,704
2Jan 29, 2022 22:2427,533305,037,915228,524,78202,260,992
3Jan 29, 2022 22:2427,942299,588,325231,919,98002,248,704
4Jan 29, 2022 22:2427,992254,170,854231,329,0001,001,0002,260,992
5Jan 29, 2022 22:2427,999253,679,360232,394,00002,260,992
6Jan 29, 2022 22:2428,015259,658,257231,526,0001,002,0002,371,584
7Jan 29, 2022 22:2428,042259,599,074230,753,0001,997,0002,519,040
8Jan 29, 2022 22:2428,063263,485,949230,925,0001,999,0002,260,992
9Jan 29, 2022 22:2428,612262,863,177236,478,0001,002,0002,379,776
10Jan 29, 2022 22:2428,654262,267,827235,831,0001,998,0002,371,584
11Jan 29, 2022 22:2428,685264,315,080236,088,0002,000,0002,256,896
12Jan 29, 2022 22:2428,693262,696,433236,155,0002,001,0002,371,584