304 North Cardinal St.
Dorchester Center, MA 02124

# Simple Array Sum Hacker Rank Solution – Queslers

## Problem: Simple Array Sum Hacker Rank Solution

Given an array of integers, find the sum of its elements.

For example, if the array , , so return .

Function Description

Complete the simpleArraySum function in the editor below. It must return the sum of the array elements as an integer.

simpleArraySum has the following parameter(s):

• ar: an array of integers

Input Format

The first line contains an integer, , denoting the size of the array.
The second line contains  space-separated integers representing the array’s elements.

Constraints

Output Format

Print the sum of the array’s elements as a single integer.

Sample Input

``````6
1 2 3 4 10 11
``````

Sample Output

``````31
``````

Explanation

We print the sum of the array’s elements: 1+2+3+4+10+11=31.

### Simple Array Sum Hacker Rank Solution Using Python

``````#!/bin/python3

import os
import sys

#
# Complete the simpleArraySum function below.
#
def simpleArraySum(ar):
x=0
for i in range(0,ar_count):
x = x + ar[i]
return x

if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')

ar_count = int(input())

ar = list(map(int, input().rstrip().split()))

result = simpleArraySum(ar)

fptr.write(str(result) + '\n')

fptr.close()``````

### Simple Array Sum Hacker Rank Solution Using Java

``````import java.io.*;
import java.util.*;

public class Solution {

public static void main(String[] args) throws Exception
{
int output=0;
for(String value:input)
{
output += Integer.parseInt(value);
}
System.out.println(output);
}
}``````

### Simple Array Sum Hacker Rank Solution Using C++

``````#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 */
int numLines;
int currNumber, total = 0;

cin >> numLines;

for (int i=0; i<numLines;i++) {
cin >> currNumber;
total += currNumber;
}

cout << total;

return 0;
}``````

### Simple Array Sum Hacker Rank Solution Using C

``````#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
int N;
int map;
int main() {
long int sum =0;
scanf("%d",&N);
for(int i = 0; i<N; i++)
{
scanf("%d",&map[i]);
}
for(int i=0; i<N;i++)
{
sum += map[i];
}
/* Enter your code here. Read input from STDIN. Print output to STDOUT */
printf("%ld",sum);
return 0;
}``````

### Simple Array Sum Hacker Rank Solution Using JavaScript

``````function processData(input) {
console.log(input.split(/\n/).split(/\s/).map(Number).reduce(function(a, b) {
return a + b;
}))
}

process.stdin.resume();
process.stdin.setEncoding("ascii");
_input = "";
process.stdin.on("data", function (input) {
_input += input;
});

process.stdin.on("end", function () {
processData(_input);
});``````
##### Simple Array Sum Hacker Rank Solution Review:

In our experience, we suggest you solve this Simple Array Sum Hacker Rank Solution and gain some new skills from Professionals completely free and we assure you will be worth it.

Simple Array Sum Problem is available on Hacker Rank for Free, if you are stuck anywhere between compilation, just visit Queslers to get Simple Array Sum Hacker Rank Solution.

##### Conclusion:

I hope this Simple Array Sum Hacker Rank Solution would be useful for you to learn something new from this problem. If it helped you then don’t forget to bookmark our site for more Hacker Rank, Leetcode, Codechef, Codeforce Solution.

This Problem is intended for audiences of all experiences who are interested in learning about Data Science in a business context; there are no prerequisites.

Keep Learning!

More Hacker Rank Problem & Solutions >>

Staircase Hacker Rank Solution

A Very Big Sum Hacker Rank Solution

Diagonal Difference Hacker Rank Solution

Nested Lists Hacker Rank Solution

Lists Hacker Rank Solution