Sum of primes between given range

Question

Write the shortest code for finding the sum of primes between \$a\$ and \$b\$ (inclusive).

Input

\$a\$ and \$b\$ can be taken from command line or stdin (space seperated)
Assume \$1 \le a \le b \le 10^8\$

Output Just print the sum with a newline character.

Bonus Points

If the program accepts multiple ranges (print one sum on each line), you get extra points. :)

The upper limit is too big to allow many interesting solutions (if they have to complete in reasonable time, at least). — hallvabo, Commented Jan 28, 2011 at 9:13
@hallvabo, That's ok. I don't think anyone minds an ineffcient solution. If other's object, i'll be more than happy to lower the limit — st0le, Commented Jan 28, 2011 at 9:38
Just made and ran a not very optimised or concise version of the program in C#, using 1 to 10^8. Assuming my algorithm's correct, it ran in under 1m30s, and didn't overflow from a long. Seems like a fine upper limit to me! — Nellius, Commented Jan 28, 2011 at 12:08

Community · Accepted Answer · 2020-06-17 09:04:33Z

1

Perl, 103 chars

while(<>){($a,$b)=split/ /;for($a..$b){next if$_==1;for$n(2..$_-1){$_=0if$_%$n==0}$t+=$_;}print"$t\n";}

It'll accept multiple space separated lines and give the answer for each :D

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Feb 5, 2011 at 10:57

anonymous coward

5362 silver badges9 bronze badges

Add a comment |

Mr.Wizard · Accepted Answer · 2012-07-29 13:56:32Z

1

Mathematica, 27

Predefined a and b:

a~Range~b~Select~PrimeQ//Tr

As a function (also 27):

Tr[Range@##~Select~PrimeQ]&

answered Jul 29, 2012 at 13:56

Mr.Wizard

2,63118 silver badges17 bronze badges

Add a comment |

Community · Accepted Answer · 2017-04-13 12:39:03Z

1

Python 3: 86 chars

a,b=map(int,input().split())
P=k=1
s=0
while k<=b:s+=P%k*k*(k>=a);P*=k*k;k+=1
print(s)

Uses the factorial trick with Wilson's Theorem to check whether k is prime. P%k is 1 if k is prime and 0 otherwise. If it is prime, k is added to the running sum s.

edited Apr 13, 2017 at 12:39

CommunityBot

1

answered Nov 1, 2014 at 6:59

xnor

146k26 gold badges278 silver badges647 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

Python - 194

File fsoe-sum.py:

S,E=input()
L={}
n=2
s=0
while n<=E:
        try:
                P=L[n];del L[n]
        except:
                P=[n]
                if S<=n: s+=n
        for p in P:
                m=n+p
                try:
                        if p not in L[m]:L[m].append(p)
                except:
                        L[m] = [p]
        n+=1
print s

Filesize is 194 bytes when using tabs to indent and no final newline.

Not the shortest pythonish solution but do you see the enbedded sieve? ;-)

Run:

$ python fsoe-sum.py
1,1000000
37550402023
$ python fsoe-sum.py
1,2000000
142913828922
$ python fsoe-sum.py
1000001,2000000            
105363426899
$ python -c 'print 142913828922-37550402023'
105363426899

KSFT · Accepted Answer · 2014-12-29 23:15:11Z

1

Perl, 94

my$s;map{my($a,$b)=($_,0);for(2..$a-1){$a%$_==0&&$b++}$b or$s+=$a}($ARGV[0]..$ARGV[1]);print$s

This takes input from the command line. It doesn't use regex.

edited Dec 29, 2014 at 23:15

answered Dec 29, 2014 at 21:25

KSFT

1,57710 silver badges23 bronze badges

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

1

GolfScript, 27 24 bytes

~,>{:x,{)x\%!},,2=},{+}*

This is based off of @w0lf's prime number algorithm.

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Jun 23, 2015 at 15:56

jado

2,6821 gold badge17 silver badges36 bronze badges

\$\begingroup\$ Could you please add a "how it works"? \$\endgroup\$
– Someone
Commented Jan 3, 2021 at 21:08

Add a comment |

cia_rana · Accepted Answer · 2016-09-12 12:38:58Z

1

Ruby, 60 bytes

require'prime';p=->a,b{eval Prime.each(b).reject{|x|x<a}*?+}

Usage

puts p[*gets.split.map(&:to_i)]

Inputs & Outputs

2 10     #=> 10
3 10     #=> 8
100 1000 #=> 75067

answered Sep 12, 2016 at 12:38

cia_rana

4812 silver badges5 bronze badges

Add a comment |

numbermaniac · Accepted Answer · 2017-10-11 11:32:35Z

1

Casio-Basic, 42 bytes

sum(seq(piecewise(isPrime(x),x,0),x,a,b

Uses a hybrid/piecewise function that returns the number if it's prime, otherwise return 0. seq runs this over the range a to b, then sum adds it all up.

39 bytes for the function, 3 bytes to enter a,b as parameters.

edited Oct 11, 2017 at 11:32

answered Oct 5, 2017 at 3:57

numbermaniac

7177 silver badges14 bronze badges

Add a comment |

BlackCap · Accepted Answer · 2017-10-11 13:57:42Z

1

Haskell, 47 44 bytes

a!b=sum[x|x<-[a..b],all((<)0.mod x)[2..x-1]]

SEJPM helped me save 3 bytes!

edited Oct 11, 2017 at 13:57

answered Sep 12, 2016 at 12:23

BlackCap

3,93816 silver badges33 bronze badges

\$\begingroup\$ 44 bytes: a!b=sum[x|x<-[a..b],all((<)0.mod x)[2..x-1]] (using all instead of and) \$\endgroup\$
– SEJPM
Commented Oct 11, 2017 at 12:00
\$\begingroup\$ Fails for 1!3 (gives 6 instead of 5).. \$\endgroup\$
– ბიმო
Commented Aug 9, 2018 at 0:16
\$\begingroup\$ a?b=sum[n|n<-[a..b],n>1,all((>0).mod n)[2..n-1]], works for 1?3 \$\endgroup\$
– Benji
Commented Oct 19, 2020 at 15:48

Add a comment |

caird coinheringaahin g · Accepted Answer · 2018-04-11 09:52:07Z

1

Add++, 10 bytes

L,d@ßrÞP¦+

Try it online!

How it works

D,f,@@,		; Define a dyadic function, f
		; Example arguments:	[2 23]
	d	; Duplicate;	STACK = [2 23 23]
	@	; Reverse;	STACK = [23 23 2]
	ßr	; Range;	STACK = [23 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22]
	Þ	; Filter on:
	  P	;  Primality	STACK = [23 2 3 5 7 11 13 17 19]
	¦+	; Sum;		STACK = [100]
		; Implicitly return top of stack

answered Apr 11, 2018 at 9:52

caird coinheringaahin g♦

50.2k11 gold badges126 silver badges353 bronze badges

Add a comment |

user58988user58988 · Accepted Answer · 2020-07-01 09:40:52Z

1

APL(NARS), 11 chars, 22 bytes

{+/⍵/⍨0π¨⍵}

test one range:

{+/⍵/⍨0π¨⍵}  1..23
  100
{+/⍵/⍨0π¨⍵}  1..22
  77
{+/⍵/⍨0π¨⍵}1..1
  0

test two ranges:

{+/⍵/⍨0π¨⍵}¨(1..22)(1..23)
  77 100

answered Jul 1, 2020 at 9:40

user58988

Add a comment |

zxul767 · Accepted Answer · 2020-10-17 20:34:05Z

1

Python 3: 99 chars


l,h=map(int,input().split())
print(sum(p for p in range(l,h+1) if all(p%i for i in range(2,p)))-1)

edited Oct 17, 2020 at 20:34

answered Mar 6, 2012 at 4:38

zxul767

3612 silver badges7 bronze badges

\$\begingroup\$ This is not inclusive. \$\endgroup\$
– jamylak
Commented Jul 30, 2012 at 6:23
\$\begingroup\$ As noted by jamylak, this is not an inclusive range (try inputs 2 23), and is therefore invalid per the challenge spec. As so, I’ve flagged your answer for deletion. \$\endgroup\$
– caird coinheringaahin g ♦
Commented Oct 16, 2020 at 1:52
\$\begingroup\$ I am removing this answer as per our policy on handling invalid submissions. Please feel free to edit this solution so it's valid and flag it for undeletion. \$\endgroup\$
– hyper-neutrino ♦
Commented Oct 16, 2020 at 3:19
\$\begingroup\$ Whoever reflagged this for deletion, it was undeleted after being edited. I'm marking as "Looks OK", let me know if it's still invalid. \$\endgroup\$
– rydwolf
Commented Oct 17, 2020 at 23:19

Add a comment |

zxul767 · Accepted Answer · 2020-10-18 21:17:54Z

1

Python 3: 259 characters This is a longer solution, but it's more efficient than the one-liner I first posted.

import itertools as i
l,h=map(int,input().split())
F=lambda p:lambda x:x%p
def S(s):
 while 1:
  yield (p:=next(s),s:=filter(F(p),s) if p*p<=h else s)[0]
P=lambda:(yield from S(i.count(2)))
print(sum(i.takewhile(lambda e:e<=h,i.dropwhile(lambda e:e<l,P()))))

answered Oct 18, 2020 at 21:17

zxul767

3612 silver badges7 bronze badges

Add a comment |

Razetime · Accepted Answer · 2021-02-04 11:28:21Z

1

Whispers v3, 69 bytes

> Input
> Input
>> 1…2
>> L’
>> Select∧ 4 3
>> ∑5
>> Output 6

Try it online!

simply makes an inclusive range and filters it, then sums it.

answered Feb 4, 2021 at 11:28

Razetime

27.4k3 gold badges29 silver badges72 bronze badges

Add a comment |

Makonede · Accepted Answer · 2021-06-02 19:37:24Z

Python 2, 82 bytes

for i in range(input(),input()+1):P=n=1;exec'P*=n*n;n+=1;'*~-i;exec P%n*'print;'*i

Try it online! Outputs in unary using a newline as a tally mark.

for i in range(input(),input()+1):P=n=1;exec'...'*~-i;exec P%n*'...'*i  # trimmed program
for   in                         :     ;             ;                  # for... 
    i                                                                   # variable...
for   in                         :     ;             ;                  # in...
         range(       ,         )                                       # [...
               input()                                                  # input...
         range(                 )                                       # , ...,
                       input()                                          # input...
                              +                                         # plus...
                               1                                        # literal...
         range(                 )                                       # ]...
                                     =                                  # set...
                                    n                                   # variable...
                                     =                                  # to...
                                      1                                 # literal
                                   =                                    # set...
                                  P                                     # variable...
                                   =                                    # to...
                                    n                                   # variable
                                        exec                            # execute...
                                            '...'                       # literal...
                                                 *                      # repeated...
                                                  ~                     # negative...
                                                   -                    # negative...
                                                    i                   # variable...
                                                  ~                     # minus 1...
                                                 *                      # times...
                                        exec                            # as Python code
                                                      exec              # execute...
                                                               '...'    # literal...
                                                              *         # repeated...
                                                           P            # variable...
                                                            %           # modulo...
                                                             n          # variable...
                                                              *         # times...
                                                                    *   # repeated...
                                                                     i  # variable...
                                                                    *   # times...
                                                      exec              # as Python code

====================

P*=n*n;n+=1;  # full program
 *=           # set...
P             # variable...
 *=           # to...
P             # variable...
 *=           # multiplied by...
   n          # variable...
    *         # multiplied by...
     n        # variable
        +=    # set...
       n      # variable...
        +=    # to...
          1   # literal...
        +=    # added to...
       n      # variable

====================

print;  # full program
print   # output nothing with a trailing newline

Wasif · Accepted Answer · 2021-06-25 17:31:25Z

1

Factor + `math.primes`, 37 bytes

: f ( x y -- n ) primes-between sum ;

Try it online!

answered Jun 25, 2021 at 17:31

Wasif

12.4k1 gold badge17 silver badges47 bronze badges

Add a comment |

Fatalize · Accepted Answer · 2022-02-21 15:44:15Z

1

Brachylog, 5 bytes

⟦₂ṗˢ+

Try it online!

Explanation

⟦₂       Range from the 2 numbers in the Input
  ṗˢ     Select all primes
    +    Sum

answered Feb 21, 2022 at 15:44

Fatalize

39.1k5 gold badges70 silver badges162 bronze badges

Add a comment |

The Thonnu · Accepted Answer · 2023-03-15 11:17:02Z

1

Thunno, \$ 7 \log_{256}(96) \approx \$ 5.76 bytes

1+:gNkS

Attempt This Online!

Takes \$ b \$ first, then \$ a \$

Explanation

1+:gNkS  # Implicit input, b then a
1+       # Pop b and push b+1
  :      # Pop both and push [a..b+1)
   gNk   # Filter for primes only
      S  # Sum the resulting list

answered Mar 15, 2023 at 11:17

The Thonnu

18.3k3 gold badges15 silver badges74 bronze badges

Add a comment |

emirps · Accepted Answer · 2023-03-16 12:40:02Z

1

Stax, 8 bytes

Φ└♪Y╓U↨M

Run and debug it

This is a packed stax program which unpacks to the following 10 bytes:

^|r{|p}f|+

Run and debug it

^|r{|p}f|+ # takes input a,b
^          # increment b
 |r        # range from a..b+1
   {  }f   # filter by
    |p     # is prime?
        |+ # sum

answered Mar 16, 2023 at 12:40

emirps

1,8075 silver badges15 bronze badges

Add a comment |

emirps · Accepted Answer · 2023-03-16 13:17:09Z

1

CJam, 11 bytes

),\>{mp},:+

Try it online!

Essentially a port of my Stax answer

Explanation

),\>{mp},:+ # function taking a,b
)           # increment b
 ,          # range 0..b+1
  \         # swap to put a on top of stack
   >        # drop a elements from the range 0..b+1, essentially making it range(a,b+1)
    {  },   # filter by
     mp     # primality
         :+ # sum

answered Mar 16, 2023 at 13:17

emirps

1,8075 silver badges15 bronze badges

Add a comment |

chunes · Accepted Answer · 2023-03-16 19:14:53Z

1

Arturo, 38 36 bytes

print∑select..loop arg=>do=>prime?

print         ; print
∑             ; sum
select        ; select certain items from a block
..            ; range
loop arg=>do  ; eval each command line argument and place on stack
=>prime?      ; are they prime? (select)

edited Mar 16, 2023 at 19:14

answered Mar 16, 2023 at 18:58

chunes

26.4k3 gold badges23 silver badges53 bronze badges

Add a comment |

lyxal · Accepted Answer · 2023-05-02 01:44:43Z

1

Vyxal `s`, 20 bits¹, 2.5 bytes

ṡ~æ

Try it Online!

Somehow, I never noticed the existing answer is actually invalid.

Explained

ṡ~æ
ṡ    # Range [a, b]
 ~æ  # Filtered to only contain primes
# Summed by the s flag

answered May 2, 2023 at 1:44

lyxal

34k2 gold badges63 silver badges139 bronze badges

Add a comment |

Bartosz Jabłoński · Accepted Answer · 2023-05-14 12:27:51Z

SAS, 130 134

I got suggestion that use of macro variables for input is "invalid method", here is other version of the code which basically wraps the original one (look below) inside a %window statement (makes it more obfuscated and limits it use to the DMS env. only):

The prompt window for DMS:

%window i a 4 b 4;%display i;

[Edit: some spaces were not necessary.] The code that sums primes and prints result to the log

data;array a[&b](. 2:&b);do i=2to sqrt(&b);if a[i]then do j=2*a[i]by a[i]while(j<=&b);a[j]=.;end;end;x=sum(of a&a--a&b);put x;run;

Length of the code which "does the job" effectively stays the same.

Let me share a comment about "invalidity" of the first approach:

Passing input data in all 3 programming interfaces SAS DMS, SAS EG, or SAS Studio can be done:

by a SAS dataset,
by a text file,
hard-coded inside data step, and
by macrovariables.

A programmer does not have to wrap-up 4GL code inside a macro to use macrovariables in it, for example the following works perfectly well:

%let a=42;

data _null_;
  the_answer=&a.;
  put the_answer;
run;

The DMS allows window and display statements and they macro language counterparts %window and %display to produce a prompt input window. Unfortunately those are DMS "specific" and not working in the EG or SAS Studio interfaces.

Assuming we are working in the DMS env. For a SAS programmer execution of the following code, which creates and opens prompt input window:

%window in
@1 'a:' a 8 'b:' b 8;
%display in;

just before the data step and typing in values of a and b

is effectively equivalent to running:

%let a=XXX;
%let b=YYY;

with XXX and YYY as values for a and b.

The original post below:

input in SAS can be done by macrovariables:

%let a=3;
%let b=1000000;

the code sums primes and prints result to the log

data;array a[&b](. 2:&b);do i=2 to sqrt(&b);if a[i] then do j=2*a[i] by a[i] while(j<=&b);a[j]=.;end;end;x=sum(of a&a--a&b);put x;run;

more readable version, _null_ added to stop dataset creation:

%let a=3;
%let b=1000000;
data ;
  array a[&b] (. 2:&b); /* array of integers from 2 to b */
  do i = 2 to sqrt(&b); /* loop until sqrt of b */
    if a[i] then        /* if there is value in the array at i */
      do j=2*a[i] by a[i] while (j<=&b);
        a[j] = .;       /* ... replace all multiplicities of a[i] with missings */
      end;
  end;
  x = sum(of a&a--a&b); /* sum elements for position a to b */
  put x;
run;

Jo King · Accepted Answer · 2023-05-16 12:23:41Z

SAS, 163 bytes

I got suggestion that use of macro variables for input is "invalid method", here is other version of the code which basically wraps the original one (look below) inside a %window statement (makes it more obfuscated and limits it use to the DMS env. only):

The prompt window for DMS:

%window i a 4 b 4;%display i;

The code that sums primes and prints result to the log

data;array a[&b](. 2:&b);do i=2 to sqrt(&b);if a[i] then do j=2*a[i] by a[i] while(j<=&b);a[j]=.;end;end;x=sum(of a&a--a&b);put x;run;

Length of the code which "does the job" effectively stays the same.

Let me share a comment about "invalidity" of the first approach:

Passing input data in all 3 programming interfaces SAS DMS, SAS EG, or SAS Studio can be done:

by a SAS dataset,
by a text file,
hard-coded inside data step, and
by macrovariables.

A programmer does not have to wrap-up 4GL code inside a macro to use macrovariables in it, for example the following works perfectly well:

%let a=42;

data _null_;
  the_answer=&a.;
  put the_answer;
run;

The DMS allows window and display statements and they macro language counterparts %window and %display to produce a prompt input window. Unfortunately those are DMS "specific" and not working in the EG or SAS Studio interfaces.

Assuming we are working in the DMS env. For a SAS programmer execution of the following code, which creates and opens prompt input window:

%window in
@1 'a:' a 8 'b:' b 8;
%display in;

just before the data step and typing in values of a and b

is effectively equivalent to running:

%let a=XXX;
%let b=YYY;

with XXX and YYY as values for a and b.

The original post below:*

input in SAS can be done by macrovariables:

%let a=3;
%let b=1000000;

the code sums primes and prints result to the log

data;array a[&b](. 2:&b);do i=2 to sqrt(&b);if a[i] then do j=2*a[i] by a[i] while(j<=&b);a[j]=.;end;end;x=sum(of a&a--a&b);put x;run;

more readable version, _null_ added to stop dataset creation:

%let a=3;
%let b=1000000;
data ;
  array a[&b] (. 2:&b); /* array of integers from 2 to b */
  do i = 2 to sqrt(&b); /* loop until sqrt of b */
    if a[i] then        /* if there is value in the array at i */
      do j=2*a[i] by a[i] while (j<=&b);
        a[j] = .;       /* ... replace all multiplicities of a[i] with missings */
      end;
  end;
  x = sum(of a&a--a&b); /* sum elements for position a to b */
  put x;
run;

JBernardo · Accepted Answer · 2013-07-05 03:26:23Z

0

Python, 133

A little bit of sorcery:

x,y=map(int,raw_input().split())
y+=1
a=range(y)
print sum(i for i in[[i for a[::i]in[([0]*y)[::i]]][0]for i in a[2:]if a[i]]if i>=x)

edited Jul 5, 2013 at 3:26

answered Sep 5, 2011 at 1:30

JBernardo

1,93616 silver badges24 bronze badges

\$\begingroup\$ You can remove y+=1 and instead use range(y+1) and ([0]*-~y)[::i] to save a byte (removing the newline). And using Python 3 will allow you to use input(), as long as you put parentheses after print, therefore removing 4 bytes, but adding 1. Worth it. \$\endgroup\$
– mbomb007
Commented Jun 26, 2015 at 21:54

Add a comment |

Ming-Tang · Accepted Answer · 2014-08-10 07:52:14Z

0

F# (141)

One third of the code is for parsing the input.

let[|a;b|]=System.Console.ReadLine().Split(' ')
{int a..int b}|>Seq.filter(fun n->n>1&&Seq.forall((%)n>>(<>)0){2..n-1})|>Seq.sum|>printfn"%A"

answered Aug 10, 2014 at 7:52

Ming-Tang

6,0273 gold badges24 silver badges45 bronze badges

Add a comment |

DanaJ · Accepted Answer · 2015-06-23 16:37:46Z

0

Perl, 62 with bonus

use ntheory":all";while(<>){say vecsum(@{primes(split/\s+/)})}

Takes lines with two whitespace separated numbers and prints the sum of primes within the range. Exits when it sees EOF.

47 for the simple case we assume the input magically arrives in $a and $b like a few other solutions:

use ntheory":all";forprimes{$s+=$_}$a,$b;say$s

or

use ntheory":all";say vecsum(@{primes($a,$b)})

With a newer module version that can be 39 characters:

use ntheory":all";say sum_primes($a,$b)

edited Jun 23, 2015 at 16:37

answered Nov 1, 2014 at 6:15

DanaJ

5064 silver badges6 bronze badges

Add a comment |

Alex A. · Accepted Answer · 2015-06-25 21:12:36Z

Julia, 69 bytes

a,b=int(split(readline()));println(sum(setdiff(primes(b),primes(a))))

This reads a space-delimited pair of integers from STDIN and prints the result to STDOUT. The only thing I've really golfed here is whitespace; otherwise this is probably how I would go about it in a non-golfing context.

Ungolfed + explanation:

# Read a line from STDIN, split it into an array on the space, convert
# the elements to integers, and assign the first element to a and the
# second to b
a, b = int(split(readline()))

# Get the primes between a and b inclusive. primes(x) returns the primes
# <= x, so the set difference of primes(b) and primes(a) will get us only
# those between a and b
d = setdiff(primes(b), primes(a))

# Print the sum to STDOUT
println(sum(d))

Just realized how old this challenge is.

caird coinheringaahin g · Accepted Answer · 2020-10-16 01:50:47Z

0

Scala, 260 bytes

object P extends App{
def c(M:Int)={val p=(false::false::true::List.range(3,M+1).map(_%2!=0)).toArray
for(i<-(3 to M)
if p(i))
{var j=i*i
while(j<M){p(j)=false
j+=i}}
p}
val l=args.map(_.toInt)
val p=c(l(1))
println((l(0)to l(1)).filter(p).map(_.toLong).sum)}

A self-written primes-sieve.

time scala P 3900000 4000000
25811704341

real    0m8.288s
user    0m6.968s
sys 0m0.456s

edited Oct 16, 2020 at 1:50

caird coinheringaahin g♦

50.2k11 gold badges126 silver badges353 bronze badges

answered Sep 5, 2011 at 1:06

user unknown

4,59131 silver badges31 bronze badges

Add a comment |

caird coinheringaahin g · Accepted Answer · 2020-10-16 01:58:15Z

0

PowerShell, 94 bytes

$a,$b=$args[0,1]
(.{$p=2..$b
while($p){$p[0];$p=@($p|?{$_%$p[0]})}}|
?{$_-gt$a}|
measure -s).sum

edited Oct 16, 2020 at 1:58

caird coinheringaahin g♦

50.2k11 gold badges126 silver badges353 bronze badges

answered Oct 29, 2013 at 16:55

Rynant

2,38315 silver badges18 bronze badges

Add a comment |

Sum of primes between given range

61 Answers 61

Perl, 103 chars

Mathematica, 27

Python 3: 86 chars

Python - 194

Perl, 94

GolfScript, 27 24 bytes

Ruby, 60 bytes

Usage

Inputs & Outputs

Casio-Basic, 42 bytes

Haskell, 47 44 bytes

Add++, 10 bytes

How it works

APL(NARS), 11 chars, 22 bytes

Whispers v3, 69 bytes

Python 2, 82 bytes

Factor + math.primes, 37 bytes

Brachylog, 5 bytes

Explanation

Thunno, \$ 7 \log_{256}(96) \approx \$ 5.76 bytes

Explanation

Stax, 8 bytes

CJam, 11 bytes

Explanation

Arturo, 38 36 bytes

Vyxal s, 20 bits1, 2.5 bytes

Explained

SAS, 130 134

SAS, 163 bytes

Python, 133

F# (141)

Perl, 62 with bonus

Julia, 69 bytes

Scala, 260 bytes

PowerShell, 94 bytes

Your Answer

Sign up or log in

Post as a guest

Not the answer you're looking for? Browse other questions tagged code-golfprimes or ask your own question.

Linked

Related

Hot Network Questions

Factor + `math.primes`, 37 bytes

Vyxal `s`, 20 bits¹, 2.5 bytes

Not the answer you're looking for? Browse other questions tagged
code-golf
primes
or ask your own question.