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 listMar 7, 2024 04:53Huy Duc LeHuy Duc LeScore: 12,184Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 7, 2024 04:5312,169129,265,370100,003,0001,000,0002,269,184
2Mar 7, 2024 04:5312,179125,150,18899,084,0002,001,0002,273,280
3Mar 7, 2024 04:5312,180134,630,344100,096,0001,000,0002,285,568
4Mar 7, 2024 04:5312,181130,569,69399,099,0002,002,0002,269,184
5Mar 7, 2024 04:5312,184126,384,25699,122,0002,002,0002,285,568
6Mar 7, 2024 04:5312,184129,212,795100,127,0001,001,0002,285,568
7Mar 7, 2024 04:5312,184132,491,58199,128,0002,002,0002,273,280
8Mar 7, 2024 04:5312,185127,036,10799,134,0002,002,0002,285,568
9Mar 7, 2024 04:5312,187128,933,85599,151,0002,003,0002,285,568
10Mar 7, 2024 04:5312,334162,207,604102,372,11102,285,568
11Mar 7, 2024 04:5312,371161,066,516102,678,06502,285,568
12Mar 7, 2024 04:5312,805172,992,992106,279,40102,289,664