Be concise.
Be useful.
All contributions dictatorially edited by webmasters to match personal tastes.
Please do not paste any copyright violating material.
Please try to avoid dependencies to third-party libraries and frameworks.
for E of x loop
S := S + E;
end loop;
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 [x] (reduce + x))
(sum [1 20 300])
;;=> 321
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, 0);
var s = x.reduce((a, b) => a + b)
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;
s = sum(x)
s = x.sum
s = x.reduce(:+)
x.iter().sum()
let s = x.iter().sum::<i32>();
val s = x.sum()
(define s (foldr + 0 x))
(define s (fold-right + 0 x))
(define s (apply + x))
(define s (apply fx+ x))
(define s (apply + x))
s := x sum.
Dim s As Integer = x.Sum()