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 1, 2023 15:11Kevin HeaveyKevin HeaveyScore: 47,196Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 1, 2023 15:1247,153452,662,093391,367,63702,232,320
2Feb 1, 2023 15:1147,194453,188,941391,707,72502,256,896
3Feb 1, 2023 15:1247,194452,948,251391,710,79702,224,128
4Feb 1, 2023 15:1147,196457,835,716391,730,76102,211,840
5Feb 1, 2023 15:1147,216478,754,934391,896,02702,224,128
6Feb 1, 2023 15:1247,228452,748,102391,988,44802,228,224