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 22, 2024 00:44Christopher MullinsChristopher MullinsScore: 143,572Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2024 00:44143,4471,220,156,5871,187,613,0002,999,0002,486,272
2Dec 22, 2024 00:44143,4681,219,072,2261,190,783,00002,478,080
3Dec 22, 2024 00:44143,5301,225,998,2481,189,298,0001,998,0002,473,984
4Dec 22, 2024 00:44143,5631,213,560,7351,187,576,0003,998,0002,478,080
5Dec 22, 2024 00:44143,5721,216,276,4071,187,649,0003,998,0002,486,272
6Dec 22, 2024 00:44143,6261,222,993,3211,191,092,0001,000,0002,469,888
7Dec 22, 2024 00:44143,6361,219,741,3641,188,179,0003,997,0002,482,176
8Dec 22, 2024 00:44143,7311,221,651,5831,190,970,0001,999,0002,469,888
9Dec 22, 2024 00:44143,7451,222,576,2761,188,086,0004,996,0002,310,144