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 16, 2026 07:22M-RochatM-RochatScore: 109,859Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 07:26109,097104,590,67394,888,0001,118,0002,113,536
2May 16, 2026 07:26109,573105,001,87395,295,0001,130,0002,113,536
3May 16, 2026 07:26109,630105,026,45695,452,0001,023,0002,117,632
4May 16, 2026 07:26109,669105,112,03295,395,0001,114,0002,113,536
5May 16, 2026 07:26109,859107,255,43995,549,0001,127,0002,113,536
6May 16, 2026 07:26109,910105,240,35195,608,0001,113,0002,117,632
7May 16, 2026 07:26110,023105,424,59295,688,0001,133,0002,113,536
8May 16, 2026 07:26110,031105,349,88195,705,0001,123,0002,113,536
9May 16, 2026 07:26110,105105,301,77995,875,0001,018,0002,113,536