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 listJul 17, 2023 18:01Bernard TeoBernard TeoScore: 117,023Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2023 17:55116,671167,429,510102,670,78802,248,704
2Jul 17, 2023 18:01116,761170,875,128102,749,62702,256,896
3Jul 17, 2023 17:55116,900163,202,749102,871,79102,248,704
4Jul 17, 2023 18:00116,928175,009,684102,897,05902,256,896
5Jul 17, 2023 18:00117,023170,812,903102,979,80802,252,800
6Jul 17, 2023 17:55117,036160,834,221102,991,46102,248,704
7Jul 17, 2023 18:00117,123164,115,641103,068,58202,248,704
8Jul 17, 2023 18:01117,313164,274,430103,235,34602,256,896
9Jul 17, 2023 18:01122,996161,501,447108,236,42102,256,896