JavaEasyNumbers10 min

Sum the digits of an integer

Print the sum of the decimal digits of the absolute value of n. Follow the stated ordering and edge-case conventions exactly. Interviewers use this task to probe algorithm selection, invariants, and boundary handling.

Input

One signed integer n.

Output

Print the sum of the decimal digits of the absolute value of n.

Constraints

-2147483648 <= n <= 2147483647.

Example

Input

Output

Example 2 input

1000000000

Output

This example exercises a further boundary or ordering case.

Public test cases (2)

Input
```
12345
```
Expected output
```
15
```
Input
```
-908
```
Expected output
```
17
```

Hints (2)

Identify the state needed to avoid recomputing work for each element.
Read into long before taking the absolute value, then repeatedly extract the last digit.

Target complexity: time O(d) · space O(1)

Your solution

import java.util.*;
import java.math.BigInteger;

public class Main {
    
    static String sum_of_digits(Scanner s) {
        while (s.hasNextLine()) s.nextLine();
        // your code
        return "";
    }
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        System.out.println(sum_of_digits(s));
    }
}

Standard input

Checking runner availability…

Reference solution

Anagram check · Easy
Check for an Armstrong number · Easy
Check whether a number is a palindrome · Easy
Check whether an integer is prime · Easy
Compute a factorial with BigInteger · Easy
Count vowels and consonants · Easy
Find the first occurrence with binary search · Easy
Find the GCD and LCM · Easy
Find the minimum and maximum in an array · Easy
Generate the Fibonacci series · Easy

All Java programs

Sum the digits of an integer

Input

Output

Constraints

Example

Public test cases (2)

Your solution

Reference solution

More Java programs