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 21, 2021 22:33Yuriy LyfenkoYuriy LyfenkoScore: 40,506Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 21, 2021 22:3340,500402,152,274336,147,14702,224,128
2Dec 21, 2021 22:3340,506400,396,936336,196,66602,211,840
3Dec 21, 2021 22:3340,508396,698,383336,218,77702,211,840