A Very Big Sum

Problem Statement

You are given an array of integers of size N. You need to print the sum of the elements of the array.

Note: The range of the 32-bit integer is −231 to 231−1 or [−2147483648,2147483647]. When we add several integer values, the resulting sum might exceed this range. You might need to use long long int in C/C++ or long data type in Java to store such sums.

Input Format

The first line of the input consists of an integer N. The next line contains N space-separated integers describing the array.

Constraints
1≤N≤10
0≤A[i]≤1010

Output Format

Output a single value equal to the sum of the elements of the array.

Sample Input

5
1000000001 1000000002 1000000003 1000000004 1000000005

Sample Output

5000000015

Solution

  
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */
    long a[10],sum=0;
    int t;
    cin>>t;
    while(t--){
        cin>>a[t];
        sum+=a[t];
    }
    cout<<sum;
    return 0;
}

Leave a Reply