Related content:

Calculate a derivative Calculate a triangle number Calculate an integer square root Calculate digits of e Calculate digits of pi Calculate distance between two points on a globe Calculate the average of a series Calculate the Fibonacci sequence Calculate the greatest common denominator Calculate the factorial of a number Calculate the sum over a container

This code demonstrates how to calculate the sum of a container (most often an array or similar structure).

Contents 1 See also 2 Implementations 2.1 Algol 68 2.2 Assembly 2.3 C 2.4 C++ 2.5 Common Lisp 2.6 Erlang 2.7 Excel 2.8 F# 2.9 Haskell 2.10 Java 2.11 OCaml 2.12 Perl 2.13 Python 2.14 Ruby 2.15 Scheme 2.16 Tcl 2.17 Zsh

See also

• Perform simple mathematical operations on two matrices
• Category:Arrays

Implementations

Algol 68

The following function computes the sum of the elements of the array passed to it. The type of the array elements is called NUM, which can be defined as any suitable integer or real type.

MODE NUM = INT; # type of array element #

PROC sum = ([] NUM a) NUM :
    BEGIN
        NUM result := 0;
        FOR i FROM LWB a TO UPB a DO
            result +:= a[i]
        OD;
        result
    END

For instance, the call

sum((3, 4, 5, 6))

returns 18.

Assembly

INT_MAX = 2147483647.

sum proc
	mov ecx,DWORD PTR [esp]
	add esp,4
	xor eax,eax
	sum_loop1:
	add eax,DWORD PTR [esp]
	add esp,4
	cmp DWORD PTR [esp],2147483647
	jne sum_loop1
	mov DWORD PTR [esp],ecx
	ret
sum endp

C

int total( int numbers[], int size ) {
   int sum = 0, i;
   for ( i = 0 ; i < size ; i++ )
   {
      sum += numbers[i];
   }
   return sum;
}

C++

#include<numeric>

sum = std::accumulate(coll.begin(),coll.end(),0);

Common Lisp

(reduce #'+ list)
(reduce #'+ list :initial-value 0) ; improved version that also works with empty lists

Another way:

(apply #'+ list)

Erlang

lists:sum(List).

Excel

=SUM([cells])

F#

Seq.sum container

Haskell

sum container

For example:

Prelude> sum [1, 2, 3, 4]
10

Java

import java.util.*;

public class Total {

    public static int total(int... values) {
        int total = 0;
        for (int i : values) total += i;       
        return total;
    }

    public static void main(String[] args) {

        System.out.println("Total: %d: ", total(1,2,4,40));
        
    }
}

OCaml

Summing is a special case of folding the addition operator starting with zero:

# let sum = List.fold_left ( + ) 0;;
val sum : int list -> int = <fun>

For example:

# sum [1; 2; 4; 40];;
- : int = 47

Perl

use List::Util qw(sum);
sum @arr;
sum 0, @arr; # improved version that also works with empty arrays

Python

A function that sums the values in a sequence is built into python, its name is 'sum'.

assert sum([1,2,3]) == 6

Ruby

class Array
  def sum
    inject { |s, v| s += v }
  end
end

Or more concisely,

class Array
  def sum
    reduce(:+)
  end
end

Scheme

(apply + list)

Tcl

proc sum list {expr ([join $list +])}

Zsh

zsum() {
	local -a array
	array=(1 2 3 4 5)
	(( sum=${(j:+:)array} ))
	return sum
}