This language bar is your friend. Select your favorite languages!
int sum = 0;
for (int i = 0; i < n; ++i) {
  sum += x[i];
}
int i,s;
for(i=s=0;i<n;i++)
{
	s+=x[i];
}
List.fold_left (+) 0 l
(defn sum [xs] (reduce + xs))

(sum [1 20 300])
;;=> 123
#include <functional>
#include <numeric>
int s = std::accumulate(x.begin(), x.end(), 0, std::plus<int>());
using System.Collections.Generic;
using System.Linq;
var s = x.Sum();
import std.algorithm.iteration;
auto s = x.sum();
var s = x.fold(0, (a, b) => a + b);
s = Enum.sum(x)
S = lists:sum(X).
   s = sum(x)
s := 0
for _, v := range x {
	s += v
}
s = sum x
var s = x.reduce((a, b) => a + b)
var s = x.reduce((a, b) => a + b, 0);
int s = 0;
for (int i : x) {
  s += i;
}
val numbers = listOf(1, 2, 3, 4)
val sum = numbers.sum()
(reduce #'+ x)
s = 0
for i,v in ipairs(x) do
   s = s + v
end
$s = array_sum($x);
var
  _x: Array of integer;
  _s, i: Integer;
begin
  _s := 0;
  //assume _x contains some values
  for i := Low(_x) to High(_x) do _s := _s + _x[i];
end;
use List::Util 'sum';
$s = sum(@x);
s = sum(x)
s = x.reduce(:+)
s = x.sum
let mut s=0;
for &i in &x
{
    s+=i;
}
let s = x.iter().sum::<i32>();
val s = x.sum()
(define s (foldr + 0 x))
Dim s As Integer = x.Sum()

Do you know the best way to do this in your language ?
New implementation...

Idiom created by

deleplace