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 listFeb 11, 2024 06:06CuteSocksCuteSocksScore: 19,920Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2024 06:0619,712238,956,673163,607,34902,232,320
2Feb 11, 2024 06:0619,718225,573,526163,659,28902,232,320
3Feb 11, 2024 06:0619,732240,871,280163,771,80802,232,320
4Feb 11, 2024 06:0619,866195,550,555163,885,000999,0002,523,136
5Feb 11, 2024 06:0619,872194,562,220163,935,000999,0002,519,040
6Feb 11, 2024 06:0619,882192,750,328164,020,0001,000,0002,519,040
7Feb 11, 2024 06:0619,920188,923,432164,331,0001,002,0002,519,040
8Feb 11, 2024 06:0619,923189,341,218165,360,00002,486,272
9Feb 11, 2024 06:0620,117199,548,192165,973,000999,0002,519,040
10Feb 11, 2024 06:0620,119197,328,289163,986,0002,999,0002,519,040
11Feb 11, 2024 06:0620,133192,158,082166,100,0001,000,0002,482,176
12Feb 11, 2024 06:0620,190192,069,814166,570,0001,003,0002,310,144