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 listDec 9, 2024 19:38virusegvirusegScore: 82,007Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2024 19:3881,858702,255,567618,472,00060,948,0002,531,328
2Dec 9, 2024 19:3881,886708,649,880621,680,00057,970,0002,301,952
3Dec 9, 2024 19:3881,901708,920,834622,801,00056,981,0002,310,144
4Dec 9, 2024 19:3881,994705,337,664622,586,00057,961,0002,293,760
5Dec 9, 2024 19:3882,007707,007,377618,687,00061,968,0002,285,568
6Dec 9, 2024 19:3882,052704,032,920619,031,00062,003,0002,297,856
7Dec 9, 2024 19:3882,117708,115,097621,607,00059,962,0002,289,664
8Dec 9, 2024 19:3882,159711,551,444617,924,00063,992,0002,289,664
9Dec 9, 2024 19:3882,386715,868,469618,821,00064,981,0002,465,792