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 14:01Bernard TeoBernard TeoScore: 91,048Success
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 14:0190,938820,214,593754,785,02902,269,184
2Sep 1, 2022 14:0191,048810,447,609755,700,35402,269,184
3Sep 1, 2022 14:0191,207827,627,764757,018,90102,269,184