# Task

Write a function named `sumEvenNumbers`, taking a sequence of numbers as single parameter. Your function must return the sum of **the even values** of this sequence.

Only numbers without decimals like `4` or `4.0` can be even. 

## Input
* sequence of numbers: those numbers could be integers and/or floats. 


For example, considering this input value : `[4,3,1,2,5,10,6,7,9,8]`, then your function should return `30` (because `4 + 2 + 10 + 6 + 8 = 30`).

Source: codewars | Difficulty: EASY
Tags: Sorting

Starter code: def sum_even_numbers(seq):
	

Solutions:
def sum_even_numbers(seq):
	return sum((n for n in seq if not n % 2))


def sum_even_numbers(seq):
	return sum((x for x in seq if x % 2 == 0))


def sum_even_numbers(seq):
	return sum(filter(lambda n: n % 2 == 0, seq))


def sum_even_numbers(seq):
	nums = []
	b = 0
	for i in range(len(seq)):
		if seq[i] % 2 == 0:
			nums.append(seq[i])
	for f in range(len(nums)):
		b = b + nums[f]
	return b


def sum_even_numbers(seq):
	L = []
	for i in seq:
		if i % 2 == 0:
			L.append(i)
	return sum(L)


def sum_even_numbers(seq):
	return sum((number for number in seq if number % 2 == 0))


def sum_even_numbers(seq):
	to_sum = [num for num in seq if num % 2 == 0]
	return sum(to_sum)


def sum_even_numbers(seq):
	sum = 0
	for i in range(len(seq)):
		if seq[i] % 2 == 0:
			sum += seq[i]
	return sum


sum_even_numbers = lambda _: sum([__ for __ in _ if not __ % 2])