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, 2024 10:58GraceGraceScore: 16,480Success
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, 2024 10:5816,447164,128,048135,508,0001,003,0002,285,568
2May 25, 2024 10:5816,449163,321,640135,526,0001,003,0002,285,568
3May 25, 2024 10:5816,453167,485,468135,555,0001,004,0002,285,568
4May 25, 2024 10:5816,455161,380,212136,574,00002,269,184
5May 25, 2024 10:5816,457162,789,437135,591,0001,004,0002,285,568
6May 25, 2024 10:5816,479166,493,786135,779,000998,0002,265,088
7May 25, 2024 10:5816,480163,856,106135,786,000998,0002,269,184
8May 25, 2024 10:5816,482163,347,892134,803,0001,997,0002,277,376
9May 25, 2024 10:5816,484163,483,640134,820,0001,997,0002,269,184
10May 25, 2024 10:5816,982211,660,542140,952,44202,293,760
11May 25, 2024 10:5816,988196,591,306141,003,87802,285,568
12May 25, 2024 10:5817,026203,797,376141,316,48702,293,760