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 listApr 21, 2026 10:24Victor MerckléVictor MerckléScore: 19,731Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 10:2519,49539,423,75115,138,0002,018,0002,408,448
2Apr 21, 2026 10:2519,64242,583,68516,269,0001,016,0002,379,776
3Apr 21, 2026 10:2519,67334,061,33916,295,0001,018,0002,371,584
4Apr 21, 2026 10:2519,70149,596,97616,318,0001,019,0002,375,680
5Apr 21, 2026 10:2519,73144,670,47916,343,0001,021,0002,375,680
6Apr 21, 2026 10:2519,73643,573,51016,347,0001,021,0002,269,184
7Apr 21, 2026 10:2519,75638,648,97016,364,0001,022,0002,269,184
8Apr 21, 2026 10:2519,82237,594,96316,418,0001,026,0002,269,184
9Apr 21, 2026 10:2519,83032,574,55316,425,0001,026,0002,265,088