fork(1) download 
  1. primes = 2 : filter isPrime [3..]
  2. isPrime 1 = False
  3. isPrime x = check primes where
  4.     check (p:ps) | p*p > x = True
  5.                  | x `mod` p == 0 = False
  6.                  | otherwise = check ps
  7.  
  8. main = print $ length $ takeWhile (<1000000) primes
Success #stdin #stdout 1.06s 8280KB
comments (?)
stdin 
Standard input is empty
stdout 
78498
https://ideone.com/dY8Nl6
language:
Haskell (ghc 8.4.4)
created:
12 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!