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 listJan 23, 2025 09:518QTK8QTKScore: 92,461Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2025 09:5192,124102,544,70877,066,0004,003,0002,363,392
2Jan 23, 2025 09:5192,188106,045,60477,119,0004,006,0002,482,176
3Jan 23, 2025 09:5192,264107,536,00278,185,0003,007,0002,469,888
4Jan 23, 2025 09:5192,314106,155,90979,231,0002,005,0002,461,696
5Jan 23, 2025 09:5192,461105,631,33078,353,0003,013,0002,289,664
6Jan 23, 2025 09:5192,465112,076,87277,351,0004,018,0002,510,848
7Jan 23, 2025 09:5192,468109,151,32877,354,0004,018,0002,461,696
8Jan 23, 2025 09:5192,609106,201,62879,484,0002,012,0002,281,472
9Jan 23, 2025 09:5192,669108,913,38678,529,0003,020,0002,408,448