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 listOct 24, 2023 17:51Ignas BagdonasIgnas BagdonasScore: 12,026Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2023 17:5111,784122,952,17495,814,0001,996,0002,273,280
2Oct 24, 2023 17:5111,794120,216,53396,894,000998,0002,273,280
3Oct 24, 2023 17:5111,869131,637,20497,504,0001,005,0002,273,280
4Oct 24, 2023 17:5111,872130,513,84597,535,0001,005,0002,273,280
5Oct 24, 2023 17:5111,884130,055,34896,625,0002,013,0002,273,280
6Oct 24, 2023 17:5111,895124,447,44097,735,000997,0002,273,280
7Oct 24, 2023 17:5112,026124,560,06396,822,0002,994,0002,273,280
8Oct 24, 2023 17:5112,028125,587,83897,835,0001,996,0002,269,184
9Oct 24, 2023 17:5112,029126,721,46496,848,0002,995,0002,273,280
10Oct 24, 2023 17:5112,048161,273,15899,997,86902,289,664
11Oct 24, 2023 17:5112,310168,389,801102,176,91702,297,856
12Oct 24, 2023 17:5112,334178,637,684102,370,41602,297,856