Sum of Digits

Easy Recursion
Solve in Playground →

Problem Statement

Write a recursive C function to calculate the sum of digits of a given non-negative integer N.

Input Format

A single non-negative integer N.

Output Format

Print the sum of digits.

Constraints

0 <= N <= 1000000000

Sample Input

12345

Sample Output

15

Explanation

1 + 2 + 3 + 4 + 5 = 15 calculated recursively.

Starter Code

#include <stdio.h>

int sumOfDigits(long long n) {
    // Write recursive logic here
}

int main() {
    long long n;
    if (scanf("%lld", &n) == 1) {
        printf("%dn", sumOfDigits(n));
    }
    return 0;
}

Limits

  • Time Limit: 1s
  • Memory Limit: 256MB

Embedded C Programming

Updated: March 15, 2026
Intermediate

Embedded systems rely on efficient low-level programming to interact directly with hardware. In this course, you will learn how to write practical Embedded C programs used in real microcontroller-based systems. Rather than focusing only on theory, this course follows a practice-driven approach. Each lesson includes hands-on coding exercises that simulate real firmware development tasks used