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 listSep 1, 2022 17:26Bernard TeoBernard TeoScore: 35,627Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2022 17:2635,626378,403,576295,692,21002,285,568
2Sep 1, 2022 17:2635,627352,539,809295,701,36602,289,664
3Sep 1, 2022 17:2635,639365,124,430295,806,09802,256,896