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.

Back to listMar 28, 2026 06:42Dominique GarmierDominique GarmierError
Source Code

Source code access is restricted. Log in to request access.

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 10:08Tomislav Tunkovic44.57CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 10:090111,499,183103,246,00002,113,536expected "29110931099849 ", got "25967235249103 "
2Sep 9, 2026 10:090115,205,306107,032,00002,113,536expected "29292281536140 ", got "25005290078772 "
3Sep 9, 2026 10:090117,491,076109,272,00002,113,536expected "27655789142290 ", got "23682689487443 "
4Mar 28, 2026 06:4212,56926,383,38310,056,0001,005,0002,490,368
5Mar 28, 2026 06:4212,58522,851,68610,069,0001,006,0002,535,424
6Mar 28, 2026 06:4212,60326,984,71510,083,0001,008,0002,482,176