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 11, 2022 15:33Kenneth MaplesKenneth MaplesScore: 35,006Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2022 15:3334,980346,442,262290,335,14302,293,760
2Oct 11, 2022 15:3335,006354,058,122290,549,35102,285,568
3Oct 11, 2022 15:3335,018359,960,755290,650,18302,281,472