CT1581

Sable Counts the inscriptions

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

Every season at the snowberry thicket of Winterholt, someone must reorganize the archive shelves. This year the task falls to Sable, armed only with the inscriptions register. 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| <= 134; s contains lowercase English letters.

Example 1:

Input: y57
Output: 2

Example 2:

Input: 8y3z15a194y480bc684a69zc19691612cxxxc3030z541z2zc16304z3zx56192a48452024x45304x6c1x83
Output: 59

Example 3:

Input: 88a272z3845axa2a197664cb22103a6zy63291c70c326y69c
Output: 34

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Sable Counts the inscriptions - EASY Coding Problem | CodeTikki