C :

#include<stdio.h>
int main(void)
{
    int i,n,j,sum=0;
    while(scanf("%d",&n)!=EOF)
       {
sum=0;
       for(i=1;i<=n;i++)
        {scanf("%d",&j);
        sum=sum+j;}
        printf("%d\n",sum);
       }

        return 0;

}

C++ :

#include<iostream>
#include<string.h>
#include<stdio.h>
#include<ctype.h>
#include<algorithm>
#include<stack>
#include<queue>
#include<set>
#include<math.h>
#include<vector>
#include<map>
#include<deque>
#include<list>
using namespace std;
int main()
{
    int a[999];
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        int sum=0;
        for(int i=0;i<n;i++)
        {
           cin>>a[i];
           sum+=a[i];
        }
        cout<<sum<<endl;
    }
    return 0;
}

Pascal :

var n,i:integer;
    s,a:array[1..10]of integer;
begin
     while not eof do
     begin
    read(n);
    for i:=1 to n do
    read(a[i]);
      s[1]:=a[1];
    for i:=2 to n do
    s[i]:=s[i-1]+a[i];
    writeln(s[n]);
     end;
end.

Java :

import java.util.*;
public class Main {
	public static void main(String args[]) {
		Scanner cin = new Scanner(System.in);
		int a, b, s;
		while (cin.hasNext()) {
			s = 0;
			a= cin.nextInt(); 
			while(a!=0){
				b = cin.nextInt();
				s+=b;
				a--;
			}
			System.out.println(s);
		}
	}
}