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 listMay 19, 2021 20:10Yuriy LyfenkoYuriy LyfenkoScore: 43,408Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2021 20:1043,3872,202,113,206360,113,14802,265,088
2May 19, 2021 20:1043,4082,552,262,039360,284,65302,269,184
3May 19, 2021 20:1043,4412,478,321,472360,563,28002,265,088