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 19:46TudyMTudyMScore: 30,861Success
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:5030,77946,033,67326,014,0001,072,0002,375,680
2May 3, 2026 19:5030,80641,508,80326,046,0001,064,0002,375,680
3May 3, 2026 19:5030,80643,775,07126,031,0001,079,0002,379,776
4May 3, 2026 19:5030,85943,993,58926,078,0001,078,0002,367,488
5May 3, 2026 19:5030,86146,091,81526,104,0001,054,0002,375,680
6May 3, 2026 19:5030,95545,086,96026,168,0001,073,0002,383,872
7May 3, 2026 19:5030,96146,920,81026,185,0001,061,0002,375,680
8May 3, 2026 19:5031,12657,407,69026,300,0001,091,0002,355,200
9May 3, 2026 19:5031,22958,421,62326,397,0001,085,0002,347,008