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 listDec 24, 2021 12:48Alexander KimAlexander KimScore: 28,406Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2021 12:4828,368260,045,504233,453,0002,003,0002,318,336
2Dec 24, 2021 12:4828,372263,167,762232,479,0003,006,0002,318,336
3Dec 24, 2021 12:4828,385259,320,032233,590,0002,005,0002,486,272
4Dec 24, 2021 12:4828,400260,457,393232,728,0002,996,0002,478,080
5Dec 24, 2021 12:4828,405265,062,852234,764,000998,0002,318,336
6Dec 24, 2021 12:4828,405265,486,419233,765,0001,997,0002,318,336
7Dec 24, 2021 12:4828,406266,224,460232,774,0002,997,0002,482,176
8Dec 24, 2021 12:4828,408258,303,943234,787,000999,0002,482,176
9Dec 24, 2021 12:4828,435294,379,616236,009,20802,297,856
10Dec 24, 2021 12:4828,438290,791,674236,039,25602,179,072
11Dec 24, 2021 12:4828,443301,284,015236,078,23002,179,072
12Dec 24, 2021 12:4828,447274,955,317234,112,0002,000,0002,318,336