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 listOct 25, 2021 04:12Yuriy LyfenkoYuriy LyfenkoScore: 35,471Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 25, 2021 04:1235,465360,889,862294,361,72202,215,936
2Oct 25, 2021 04:1235,471364,468,712294,410,68402,211,840
3Oct 25, 2021 04:1235,710360,414,202296,396,85702,215,936