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 25, 2022 15:46aaavrcaaavrcScore: 449,320Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2022 15:46447,4903,778,450,0183,714,167,97602,232,320
2Sep 25, 2022 15:46449,3203,799,600,1553,729,353,74302,260,992
3Sep 25, 2022 15:46452,2943,821,229,5123,754,037,01902,240,512