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 1, 2023 18:02Yuriy LyfenkoYuriy LyfenkoScore: 78,702Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 1, 2023 18:0278,644719,304,714652,745,56802,236,416
2Dec 1, 2023 18:0278,702717,466,934653,229,54402,240,512
3Dec 1, 2023 18:0279,200713,857,539657,358,62602,236,416