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 16, 2022 22:42Yuriy LyfenkoYuriy LyfenkoScore: 30,798Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2022 22:4030,773326,276,929255,417,24502,224,128
2Jan 16, 2022 22:4030,787325,226,116255,532,15202,207,744
3Jan 16, 2022 22:4230,793312,443,710255,585,97202,211,840
4Jan 16, 2022 22:4030,798315,644,700255,621,74702,211,840
5Jan 16, 2022 22:4230,799331,141,632255,632,97702,211,840
6Jan 16, 2022 22:4230,808315,984,419255,708,17902,224,128