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 20, 2021 17:47Yuriy LyfenkoYuriy LyfenkoScore: 63,221Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 20, 2021 17:4763,174603,923,073524,340,72902,215,936
2Dec 20, 2021 17:4763,221577,311,857524,736,69102,199,552
3Dec 20, 2021 17:4763,230590,601,645524,808,99302,211,840