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 listMay 3, 2026 18:56TudyMTudyMScore: 32,485Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 19:0032,45345,560,28027,497,0001,062,0002,383,872
2May 3, 2026 19:0032,47842,792,99327,522,0001,059,0002,379,776
3May 3, 2026 19:0032,48246,420,65427,517,0001,068,0002,367,488
4May 3, 2026 19:0032,48447,666,04727,521,0001,065,0002,383,872
5May 3, 2026 19:0032,48545,251,09027,512,0001,075,0002,387,968
6May 3, 2026 19:0032,53245,105,06127,551,0001,078,0002,355,200
7May 3, 2026 19:0032,53644,953,34527,560,0001,072,0002,367,488
8May 3, 2026 19:0032,53946,448,15327,559,0001,076,0002,367,488
9May 3, 2026 19:0032,64646,613,76627,662,0001,067,0002,379,776