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:40Yuriy LyfenkoYuriy LyfenkoScore: 33,215Success
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:4033,203337,305,717275,588,57302,224,128
2Dec 22, 2021 02:4033,215334,720,537275,681,94702,207,744
3Dec 22, 2021 02:4033,223332,449,323275,754,23102,224,128