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 15:39Bernard TeoBernard TeoScore: 91,292Success
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 15:3991,010819,436,426755,380,72202,273,280
2Sep 1, 2022 15:3991,292818,018,275757,725,72302,256,896
3Sep 1, 2022 15:3991,615824,631,483760,406,40102,269,184