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:07Yuriy LyfenkoYuriy LyfenkoScore: 34,872Success
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:2434,849350,587,157289,244,02102,220,032
2Jul 5, 2021 17:0734,857356,693,287289,310,29302,220,032
3Jul 5, 2021 17:0734,871357,415,761289,432,34502,224,128
4Jul 5, 2021 17:2434,872352,537,443289,439,22002,215,936
5Jul 5, 2021 17:2434,887340,103,493289,563,82902,211,840
6Jul 5, 2021 17:0735,091349,284,864291,252,13702,211,840