Problem:
Score : 200 points

Problem Statement

Find the number of palindromic numbers among the integers between A and B (inclusive).
Here, a palindromic number is a positive integer whose string representation in base 10 (without leading zeros) reads the same forward and backward.

Constraints

10000 \leq A \leq B \leq 99999

All input values are integers.

Input

Input is given from Standard Input in the following format:

A B

Output

Print the number of palindromic numbers among the integers between A and B (inclusive).

Sample Input 1

11009 11332

Sample Output 1

4

There are four integers that satisfy the conditions: 11011, 11111, 11211 and 11311.

Sample Input 2

31415 92653

Sample Output 2

612

Solution in Haskell (GHC 7.10.3) (judge verdict: Accepted)

{-# LANGUAGE OverloadedStrings   #-}
{-# LANGUAGE ScopedTypeVariables #-}

import           Control.Monad
import           Data.IORef
import qualified Data.Text     as T
import qualified Data.Text.IO  as T
import           System.IO

(+.+) = T.append
(!.!) = T.index

main :: IO ()
main = palindromicNumbers

palindromicNumbers :: IO ()
palindromicNumbers = do
  ab <- T.getLine
  let [aT, bT] = T.split (== ' ') ab
      a = read $ T.unpack aT :: Int
      b = read $ T.unpack bT :: Int
      ans = length [n | n <- [a..b], let nT = T.pack $ show n in T.reverse nT == nT]
  print ans