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 21, 2026 19:51M-RochatM-RochatScore: 44,843Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 19:5344,62149,731,43339,267,00002,113,536
2May 21, 2026 19:5344,67850,424,47339,317,00002,113,536
3May 21, 2026 19:5344,70651,143,99239,342,00002,113,536
4May 21, 2026 19:5344,77950,206,82839,406,00002,113,536
5May 21, 2026 19:5344,84350,014,86139,462,00002,113,536
6May 21, 2026 19:5344,85948,794,92539,476,00002,113,536
7May 21, 2026 19:5344,95550,432,32039,561,00002,113,536
8May 21, 2026 19:5345,04848,722,97139,643,00002,113,536
9May 21, 2026 19:5345,04848,834,39539,643,00002,113,536