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 listApr 10, 2024 08:32Matt StuchlikMatt StuchlikScore: 22,081Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 10, 2024 08:3221,858234,935,515181,422,74102,293,760
2Apr 10, 2024 08:3222,055208,845,692182,056,0001,000,0002,285,568
3Apr 10, 2024 08:3222,063204,874,275181,123,0002,001,0002,273,280
4Apr 10, 2024 08:3222,066208,011,151181,147,0002,001,0002,277,376
5Apr 10, 2024 08:3222,066210,141,696181,143,0002,001,0002,260,992
6Apr 10, 2024 08:3222,078211,413,062182,250,0001,001,0002,285,568
7Apr 10, 2024 08:3222,081207,646,189181,271,0002,002,0002,285,568
8Apr 10, 2024 08:3222,135212,776,792181,726,0001,996,0002,523,136
9Apr 10, 2024 08:3222,140208,886,137182,764,000998,0002,519,040
10Apr 10, 2024 08:3222,147209,127,178181,822,0001,998,0002,285,568
11Apr 10, 2024 08:3222,841254,768,661189,581,50502,297,856
12Apr 10, 2024 08:3222,894256,882,630190,020,77302,252,800