Here is the solution for this #Haskell challenge as proposed by @poetscher ... feel free to ping me if you have any questions
pic.twitter.com/zVu8CFqTNg
U tweetove putem weba ili aplikacija drugih proizvođača možete dodati podatke o lokaciji, kao što su grad ili točna lokacija. Povijest lokacija tweetova uvijek možete izbrisati. Saznajte više
Here is the solution for this #Haskell challenge as proposed by @poetscher ... feel free to ping me if you have any questions
pic.twitter.com/zVu8CFqTNg
There are, of course, plenty of other ways to solve this. For instance, @gheritarish4 has proposed a one-liner, building on top of foldl 
sum l = foldl (+) 0 l
If you are aiming for the shortest solution, you could also make it point-free 
Recursive: sum []=0; sum (x:xs) = x + sum xs (or for fun without destructuring: sum x = head x + sum $ tail x).
Twitter je možda preopterećen ili ima kratkotrajnih poteškoća u radu. Pokušajte ponovno ili potražite dodatne informacije u odjeljku Status Twittera.