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:11Yuriy LyfenkoYuriy LyfenkoScore: 43,421Success
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:1143,3423,329,327,169359,740,89702,269,184
2May 19, 2021 20:1143,421821,561,751360,393,31402,441,216
3May 19, 2021 20:1143,455813,688,661360,679,53802,273,280