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 listAug 21, 2021 18:11Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2021 18:1100000# highload.fun/solution ./main.go:17:18: underscores in numeric literals requires go1.13 or later (-lang was set to go1.0; check go.mod)
2Aug 21, 2021 18:1200000# highload.fun/solution ./main.go:17:18: underscores in numeric literals requires go1.13 or later (-lang was set to go1.0; check go.mod)
3Aug 21, 2021 18:2000000# highload.fun/solution ./main.go:17:18: underscores in numeric literals requires go1.13 or later (-lang was set to go1.0; check go.mod)