def simpleArraySum(ar): return sum(ar)

if name == "main": n = int(input().strip()) ar = list(map(int, input().split())) print(simpleArraySum(ar))

Rust

fn simple_array_sum(ar: &[i32]) -> i32 { let mut counter = 0;

for i in ar {
    counter += i;
}

counter

}

Simple and easy solution for C++

int simpleArraySum(vector<int> ar) {
    return accumulate(ar.begin(), ar.end(), 0);
}

For Python3 Platform

I wrote the code from scratch to get more practice

def simpleArraySum(arr):
    return sum(arr)

n = int(input())
arr = list(map(int, input().split()))

result = simpleArraySum(arr)

print(result)

in javascript is more simple :

function simpleArraySum(ar) { return ar.reduce((arr,cur)=> arr + cur, 0)

}