[Haskell-beginners] best performance with foldl

[Roland Leißa]

Hi all,

for a benchmark I'd like to write code like this:
    foldl (+) [0 100000000]

how do I get the best performance out of it? However, It is important for me 
to rely on a higher-order function. Is it possible to be en par with the C 
version?
    int64_t result = 0;
    for (int64_t i = 0; i <= 100000000; ++i)
        result += i;

Many thanks in advance for helping out,
Roland