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: 43,755Success
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:0342,742411,921,432354,761,24902,265,088
2Sep 28, 2022 18:0342,744431,244,876354,774,04602,260,992
3Sep 28, 2022 18:0342,747421,319,597354,802,85402,269,184
4Sep 28, 2022 18:4443,755440,056,619363,163,58502,269,184
5Sep 28, 2022 18:4443,787430,292,346363,433,19702,260,992
6Sep 28, 2022 18:4443,796431,857,598363,503,64002,260,992