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 listSep 28, 2022 18:44PhibPhibScore: 45,750Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2022 18:4344,549432,116,810369,752,93902,265,088
2Sep 28, 2022 18:4344,555423,315,065369,802,62802,252,800
3Sep 28, 2022 18:4344,575430,328,443369,972,17302,256,896
4Sep 28, 2022 18:4445,750447,069,228379,723,47902,256,896
5Sep 28, 2022 18:4445,757448,375,194379,781,19602,256,896
6Sep 28, 2022 18:4445,764449,515,290379,840,02002,256,896