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: 18,149Success
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:5818,127171,882,222150,452,00002,285,568
2May 25, 2024 10:5818,130179,363,808149,485,000996,0002,269,184
3May 25, 2024 10:5818,131172,473,494149,488,0001,003,0002,269,184
4May 25, 2024 10:5818,137179,129,706149,534,0001,003,0002,285,568
5May 25, 2024 10:5818,146175,082,223149,605,0001,004,0002,273,280
6May 25, 2024 10:5818,147182,372,751149,618,0001,004,0002,285,568
7May 25, 2024 10:5818,149177,746,550148,638,0001,995,0002,277,376
8May 25, 2024 10:5818,169178,953,582150,799,00002,285,568
9May 25, 2024 10:5818,415221,530,652152,842,51502,297,856
10May 25, 2024 10:5818,429205,837,902152,958,66002,289,664
11May 25, 2024 10:5818,453225,192,769153,157,15402,293,760
12May 25, 2024 10:5818,808179,931,453155,105,0001,000,0002,277,376