Sum of prime numbers Andrey Tsvetkov

Compute the sum of all prime numbers in a stream of binary integers as fast as possible.

Input: 1 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of all values that are prime, printed as a decimal string.

Discussion (3)
Log in to join the discussion.
Haha Expert
Haha ExpertSep 2, 2026 11:50

Victor Mercklé

Victor MerckléSum of prime numbersCPP
8 minutes ago

Success

Victor Mercklé

Victor MerckléFormat integersCPP
11 minutes ago

Success

 

 

 

Victor Mercklé

Victor MerckléSum of prime numbersCPP
20 minutes ago

Success

Victor Mercklé

Victor MerckléFizz BuzzCPP
20 minutes ago

Success

 

 

 

Victor Mercklé

Victor MerckléParse integersCPP
26 minutes ago

Error

Victor Mercklé

Victor MerckléFormat integersCPP
26 minutes ago

Success

 

 

 

Victor Mercklé

Victor MerckléParse integersCPP
27 minutes ago

Error

In 19 minutes, 7 solutions to 5 problems were proposed.

Haha Expert
Haha ExpertSep 2, 2026 11:40

Victor Mercklé PhD Student in Machine Learning - and my previous remarks are already starting to make sense…

Haha Expert
Haha ExpertSep 2, 2026 11:35

Maybe I don’t understand something about programming, but the leader in the overall rating spends 1 minute solving DIFFERENT tasks, which looks more like an automated process involving several AI agents.