String Sum
Practice
3.6 (95 votes)
Easy
Implementation
Problem
83% Success 16836 Attempts 20 Points 1s Time Limit 256MB Memory 1024 KB Max Code

Consider All lowercase Alphabets of the English language. Here we consider each alphabet from a to z to have a certain weight. The weight of the alphabet a is considered to be 1, b to be 2, c to be 3 and so on until z has a weight of \(26\). In short, the weight of the alphabet a is 1, and the weight of all other alphabets is the weight of its previous alphabet + 1.

Now, you have been given a String S consisting of lowercase English characters. You need to find the summation of weight of each character in this String.

For example, Consider the String \(aba\)
Here, the first character a has a weight of 1, the second character b has 2 and the third character a again has a weight of 1. So the summation here is equal to : \( 1 + 2 + 1 = 4 \)

Input Format:
The first and only line of input contains the String S.

Output Format
Print the required answer on a single line

Constraints
\( 1 \le |S| \le 1000 \)

Please login to use the editor

You need to be logged in to access the code editor

Loading...

Please wait while we load the editor

Loading...
Results
Custom Input
Run your code to see the output
Submissions
Please login to view your submissions
Similar Problems
Points:20
8 votes
Tags:
Basic ProgrammingBasics of ImplementationEasyImplementation
Points:20
29 votes
Tags:
Ad-HocAlgorithmsBasic ProgrammingBasics of ImplementationEasyImplementation
Points:30
2 votes
Tags:
MediumPrime FactorizationMathematicsOpenApprovedFactorization