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 03:59Yuriy LyfenkoYuriy LyfenkoScore: 31,824Success
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 03:5931,802316,561,924263,958,11602,179,072
2Dec 22, 2021 03:5931,824330,024,049264,137,48402,179,072
3Dec 22, 2021 03:5931,849330,769,119264,350,21002,179,072