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 listJun 29, 2021 06:19Yuriy LyfenkoYuriy LyfenkoScore: 40,397Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2021 03:5740,389403,801,045335,232,58602,220,032
2Jun 29, 2021 03:5740,391409,485,741335,246,83902,211,840
3Jun 29, 2021 06:1940,396394,446,549335,285,22002,224,128
4Jun 29, 2021 06:1940,397399,128,112335,298,19002,215,936
5Jun 29, 2021 03:5740,398395,977,640335,303,55902,207,744
6Jun 29, 2021 06:1940,418418,587,350335,470,45502,211,840