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 listJul 5, 2021 17:20Yuriy LyfenkoYuriy LyfenkoScore: 36,528Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2021 17:2036,414352,763,953302,239,57502,211,840
2Jul 5, 2021 17:2036,528375,375,422303,184,76602,215,936
3Jul 5, 2021 17:2036,544388,512,441303,312,51602,215,936