# A Very Big Sum Solution in Javascript

by Travis Scott Lee

**Problem**

In this challenge, you are required to calculate and print the sum of the elements in an array, keeping in mind that some of those integers may be quite large.

**Function Description**

Complete the aVeryBigSum function in the editor below. It must return the sum of all array elements.

aVeryBigSum has the following parameter(s):

- int ar[n]: an array of integers .

**Return**

- long: the sum of all array elements

**Input Format**

The first line of the input consists of an integer n.

The next line contains n space-separated integers contained in the array.

**Output Format**

Return the integer sum of the elements in the array.

**Constraints**

- 1 ≤ n ≤ 10
- 0 ≤ ar[i] ≤ 10¹⁰

**Sample Input**

`5`

1000000001 1000000002 1000000003 1000000004 1000000005

**Output**

`5000000015`

**Note:**

The range of the 32-bit integer is

(-2³¹) to (2³¹ — 1) or [-2147483648, 2147483648].

When we add several integer values, the resulting sum might exceed the above range. You might need to use long int C/C++/Java to store such sums.

**Solution**

First, we create a const called reducer which will serve as a function in reducing the array. Then, we set the sum equal to the arr with the reduce function along with the reducer callback. Finally, we return the sum.