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 listNov 30, 2022 15:20apuxbtapuxbtScore: 33,632Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 30, 2022 15:2033,50157,586,06428,465,0001,016,0002,265,088
2Nov 30, 2022 15:2033,50955,331,49628,472,0001,016,0002,265,088
3Nov 30, 2022 15:2033,53556,030,43728,494,0001,017,0002,265,088
4Nov 30, 2022 15:2033,57059,640,64629,542,00002,387,968
5Nov 30, 2022 15:2033,58848,871,37929,557,00002,265,088
6Nov 30, 2022 15:2033,61551,911,76728,561,0001,020,0002,396,160
7Nov 30, 2022 15:2033,63254,930,62328,576,0001,020,0002,265,088
8Nov 30, 2022 15:2033,76757,726,88128,691,0001,024,0002,523,136
9Nov 30, 2022 15:2033,77359,603,68429,720,00002,265,088
10Nov 30, 2022 15:2035,148102,610,65830,930,41002,240,512
11Nov 30, 2022 15:2035,26197,197,67531,030,11902,244,608
12Nov 30, 2022 15:2035,31491,779,49131,076,16002,232,320