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 22, 2026 10:36Pavel SkripkinPavel SkripkinScore: 265,792Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 10:37265,098248,974,693232,286,0001,001,0002,334,720
2Apr 22, 2026 10:37265,112249,390,765232,298,0001,001,0002,416,640
3Apr 22, 2026 10:37265,515249,781,263232,652,0001,002,0002,428,928
4Apr 22, 2026 10:37265,570251,133,559232,704,000998,0002,433,024
5Apr 22, 2026 10:37265,792250,567,149231,898,0001,999,0002,420,736
6Apr 22, 2026 10:37266,136250,969,163233,200,0001,000,0002,424,832
7Apr 22, 2026 10:37266,353253,014,139233,390,0001,001,0002,334,720
8Apr 22, 2026 10:37267,002249,076,366232,963,0001,999,0002,420,736
9Apr 22, 2026 10:37268,182248,258,521234,001,0002,000,0002,424,832