Processing a string

CodeChefRating 1125Open on judge ↗

Given an alphanumeric string made up of digits and lower case Latin characters only, find the sum of all the digit characters in the string. Input - The first line of the input contains an integer T denoting the number of test cases. Then T test cases follow. - Each test case is described with a single line containing a string S, the alphanumeric string. Output - For each test case, output a

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI