Haskell lazy performance test

max.hs

#!/usr/bin/env runhaskell

maximum' :: (Ord a) => [a] -> a  
maximum' [] = error "maximum of empty list"  
maximum' [x] = x  
maximum' (x:xs) = max x (maximum' xs)  

main :: IO ()
main = do
    -- print (maximum' [3, 5, 7, 3, 6])
    print (maximum' [1..6543210])

max.py

#!/usr/bin/env python
# -*- coding: utf-8 -*-

print(max([i for i in range(6543210)]))

Why is the Python code so much faster? Most likely doing something wrong in the Haskell code just not familiar enough with the language to figure it out.