Hackerrank (FP)-The Sums of Powers

In Haskell. Points:1. Pruning 2. Int suffers from overflow. Integer it is.

Getpowersum:: integer-(integer)--Integergetpowersum _ [] _ =0getpowersum TGT cand start = case Compare TGT start ofEQ-1LT-0GT- LetNewcand = Filter (>start) candinch                                         LetNEWTGT = Tgt-startinchSum $ map (getpowersum newtgt Newcand) newcandgetpowersumways:: Integer--Integer[integer]getpowersumways x n = LetCand = [I^n | i <-[1.. X], (i ^ n) <= X]inchmap (getpowersum x cand) cand--Main--main = DoSX<-getLine SN<-GetLine Letx = Read SX:: Integer Letn = Read sn:: Integer print $ sum $ getpowersumways x n

Hackerrank (FP)-The Sums of Powers