Sum of Prime Numbers

Published by Matt in
algebraarraysnumbers

Create a function that takes an array of numbers and returns the sum of all prime numbers in the array.

Examples

sum_primes([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]) ➞ 17

sum_primes([2, 3, 4, 11, 20, 50, 71]) ➞ 87

sum_primes([]) ➞ nil

Notes

  • Given numbers won't exceed 101.
  • A prime number is a number which has exactly two divisors.
Watch a quick demo on how Edabit works.