CT23778

Miller's inscriptions Digit Marks

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Morning light hits the honeycomb cliffs of Beeswick as Miller unrolls the day's manifest of inscriptions. The tally will decide the next shipment. 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| <= 672; s contains lowercase English letters.

Example 1:

Input: 450ac649zbc8aacy5c25z73c2ca9ba2354c45zay11a1149a022a37xxx913836cxxay9b2z088bc242xy4a745bca2117264c6907c99a747270967z10c8a38zbyy4xc43az7x203310aa6y31y91849c5y830x2ccx9b6b151y58ab4230623z7416x32z136444cazzczb37x4x2b71167zbcc06y6xzy83yz2c9z83a62a20x9z44y9x6y2b2x0y93cb44b055386z8xa182x7036c890z2b35c9y49x2a5875by5z68y7323049y5xc808b660c1za9b0a3bx7075yz33883605
Output: 220

Example 2:

Input: 1c6558z2ya053y18cccy8yz8a55y941zaxbzb6z0z1zc9z0cbx88yc80y937744868735y1675c933254187z15a15a0y8a83c5z0aby797y53961a73y10a8800994694c3877735c614y63yxza0550a017y3c14c251zyx3174910z2a2783931by7792b9ac2098533zc67128xb1xc19zx2b461
Output: 148

Example 3:

Input: 1b653947b524yb2935yzy784111018896x0cycb36z29zxx29zc32b54c5z7cx5206zby462c3c173zc52b7910xc4x701y1096bca6536a99xx5870a769306bycxz64901z7b8x7b2a6bx4x1c4c04yx2ya99cc7c922196020z894c30y15288x2z95119xzbb92b4z894b17yc8x29y043689207cz3a5b58771612x9zz0791a0yz2y468x693cx0xca47b22b15
Output: 174

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Miller's inscriptions Digit Marks - EASY Coding Problem | CodeTikki