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 21, 2024 20:55mahdi739mahdi739Score: 55,382Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 21, 2024 20:5555,368487,602,235457,557,0001,998,0002,285,568
2Dec 21, 2024 20:5555,373485,397,747457,601,0001,998,0002,285,568
3Dec 21, 2024 20:5555,375489,730,753457,613,0001,998,0002,285,568
4Dec 21, 2024 20:5555,382488,178,802457,672,0001,998,0002,371,584
5Dec 21, 2024 20:5555,382492,275,076457,673,0001,998,0002,285,568
6Dec 21, 2024 20:5555,387485,726,159457,715,0001,998,0002,285,568
7Dec 21, 2024 20:5555,392485,354,497458,758,000999,0002,285,568
8Dec 21, 2024 20:5555,397485,814,532457,795,0001,999,0002,285,568
9Dec 21, 2024 20:5555,408486,363,954457,889,0001,999,0002,375,680