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 22, 2021 02:25Yuriy LyfenkoYuriy LyfenkoScore: 39,183Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2021 02:2539,170386,595,782325,106,92202,220,032
2Dec 22, 2021 02:2539,183390,988,134325,216,20202,228,224
3Dec 22, 2021 02:2539,190385,948,628325,278,80902,207,744