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 listAug 17, 2023 09:23parsersmailparsersmailScore: 144,671Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2023 09:2491,063808,941,308755,823,48902,224,128
2Aug 17, 2023 09:2491,066830,698,672755,845,11602,236,416
3Aug 17, 2023 09:2491,075812,058,124755,925,52802,232,320
4Aug 9, 2023 08:32144,4891,272,502,9401,199,262,26002,244,608
5Aug 17, 2023 09:23144,6711,266,766,1201,200,768,16802,232,320
6Aug 9, 2023 08:32144,7251,268,782,2071,201,216,83302,228,224
7Aug 17, 2023 09:23144,7821,259,091,3981,201,693,68202,232,320
8Aug 9, 2023 08:32144,8641,263,650,7801,202,371,03702,232,320
9Aug 17, 2023 09:23144,9761,269,733,9301,203,303,68702,232,320