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 listOct 7, 2024 18:58Lickety SplitLickety SplitScore: 93,234Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 7, 2024 18:5893,207801,263,900769,618,0003,998,0002,306,048
2Oct 7, 2024 18:5893,234807,078,759768,845,0004,998,0002,310,144
3Oct 7, 2024 18:5893,238798,571,159769,878,0003,999,0002,367,488