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 listJan 30, 2023 13:22unsatcoreunsatcoreScore: 12,228Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 30, 2023 13:2211,234155,952,35993,239,84302,289,664
2Jan 30, 2023 13:2211,263154,047,32293,479,73602,281,472
3Jan 30, 2023 13:2211,276159,315,96593,587,45302,269,184
4Jan 30, 2023 13:2212,180124,025,75599,089,0002,001,0002,269,184
5Jan 30, 2023 13:2212,222128,637,484100,441,0001,004,0002,269,184
6Jan 30, 2023 13:2212,223129,819,930100,444,0001,004,0002,277,376
7Jan 30, 2023 13:2212,228130,993,340100,491,0001,004,0002,519,040
8Jan 30, 2023 13:2212,230123,644,965100,504,0001,005,0002,375,680
9Jan 30, 2023 13:2212,240127,618,534100,591,0001,005,0002,277,376
10Jan 30, 2023 13:2212,261127,746,54199,769,0001,995,0002,527,232
11Jan 30, 2023 13:2212,266130,654,020100,810,000998,0002,265,088
12Jan 30, 2023 13:2212,302129,328,272100,103,0002,002,0002,265,088