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 listFeb 12, 2022 21:59Yuriy LyfenkoYuriy LyfenkoScore: 12,272Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 12, 2022 21:5912,271171,971,789101,849,05502,281,472
2Feb 12, 2022 21:5912,272167,901,116101,857,26202,281,472
3Feb 12, 2022 21:5912,272168,737,143101,856,87402,285,568