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 listDec 22, 2021 02:22Yuriy LyfenkoYuriy LyfenkoScore: 39,602Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2021 02:2239,574393,950,710328,465,23302,220,032
2Dec 22, 2021 02:2239,602385,263,562328,694,09302,220,032
3Dec 22, 2021 02:2239,608381,054,241328,742,30802,207,744