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 listFeb 16, 2024 09:49Huy Duc LeHuy Duc LeScore: 12,609Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2024 09:4912,567128,663,564103,301,0001,002,0002,260,992
2Feb 16, 2024 09:4912,574126,741,520104,364,00002,273,280
3Feb 16, 2024 09:4912,575126,499,839103,372,0001,003,0002,285,568
4Feb 16, 2024 09:4912,578128,970,785102,393,0002,007,0002,285,568
5Feb 16, 2024 09:4912,580130,662,881103,411,0001,003,0002,277,376
6Feb 16, 2024 09:4912,589126,963,405104,491,00002,277,376
7Feb 16, 2024 09:4912,609135,194,839103,646,0001,006,0002,277,376
8Feb 16, 2024 09:4912,630130,972,923102,837,0001,996,0002,285,568
9Feb 16, 2024 09:4912,749132,698,645104,817,000998,0002,269,184
10Feb 16, 2024 09:4913,881176,476,888115,209,49002,293,760
11Feb 16, 2024 09:4913,890189,882,027115,287,41102,293,760
12Feb 16, 2024 09:4914,334182,971,183118,969,66002,281,472