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 19, 2026 15:55Ondřej PolaneckýOndřej PolaneckýScore: 71,175Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 15:5570,89889,631,44858,365,0004,025,0002,506,752
2Mar 19, 2026 15:5571,17590,494,37759,604,0003,030,0002,289,664
3Mar 19, 2026 15:5571,44288,652,72759,876,0002,993,0002,289,664