CT1801

Ranger's letters Reckoning

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

Deep in the peat bogs of Mossgrieve, Ranger studies rows of letters entries. One clean number will settle the guild's oldest argument. Task: Read a string of letters and digits and print how many characters are digits. Input format: One line with a string of lowercase letters and digits. Output format: Print the digit count. Constraints: 1 <= |s| <= 94; s contains lowercase English letters.

Example 1:

Input: a3x877x97b1b646650cb5z8zy34108b1c45zbzx1764327764b7b875b78x6a
Output: 40

Example 2:

Input: 358ab968cy63421ba59805ayy3463a438060y1yb8654a8z25424054473y05547x90007yz888y2cxz
Output: 57

Example 3:

Input: c0680b72y79715z7zxcza078y3z178z9y1b17c9bcba
Output: 24

Constraints:

1 <= |s| <= 94; s contains lowercase English letters.

Loading...
Test Cases:No test cases
No test cases available.