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 listMay 25, 2021 18:51Yuriy LyfenkoYuriy LyfenkoScore: 17,800Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2021 18:5117,773172,415,354146,511,0001,003,0002,379,776
2May 25, 2021 18:5117,780174,435,358146,574,0001,003,0002,260,992
3May 25, 2021 18:5117,782174,358,170146,584,0001,004,0002,392,064
4May 25, 2021 18:5117,782178,761,656146,586,0001,004,0002,260,992
5May 25, 2021 18:5117,782173,430,625146,586,0001,004,0002,523,136
6May 25, 2021 18:5117,787173,169,305146,631,0001,004,0002,260,992
7May 25, 2021 18:5117,800178,519,294146,741,000998,0002,260,992
8May 25, 2021 18:5117,801173,721,560147,750,00002,256,896
9May 25, 2021 18:5117,807174,672,859145,800,0001,997,0002,260,992
10May 25, 2021 18:5117,870200,981,845148,320,99302,273,280
11May 25, 2021 18:5118,652200,005,557154,810,66602,269,184
12May 25, 2021 18:5118,656203,692,878154,841,56102,273,280