1. Miki Tebeka
  2. euler

Source

euler / haskell / 4.hs

-- A palindromic number reads the same both ways. The largest palindrome made
-- from the product of two 2-digit numbers is 9009 = 91 99.
--
-- Find the largest palindrome made from the product of two 3-digit numbers.
--
-- Answer: 906609

import Data.List (maximum)

isPalindrom n = reverse (show n) == show n

main = print $ maximum [x*y | x <- [100..999], y <- [100..999], isPalindrom $ x*y]