Format integers Sergey Svistunov

Compute a checksum over the decimal representations of binary integers as fast as possible.

Input: 250 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: A uint64 checksum computed as:

CRC = sum of number_crc(n) for each n

where number_crc(n) converts n to its decimal string and sums ascii(digit) * position over each digit (0-indexed from the left).

Example: For n = 42, the decimal string is "42", so number_crc(42) = ascii('4') * 0 + ascii('2') * 1 = 52 * 0 + 50 * 1 = 50.

Back to listJun 7, 2024 11:09Andrey LikhachevAndrey LikhachevError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2024 11:0900000Error: Exit with code 2: panic: runtime error: index out of range [9] with length 9 goroutine 1 [running]: main.main() /tmp/solution2420362265/main.go:30 +0x1a5stderr
2Jun 7, 2024 11:1000000Error: Exit with code 2: panic: runtime error: index out of range [9] with length 9 goroutine 1 [running]: main.main() /tmp/solution970642484/main.go:33 +0x1a5stderr
3Jun 7, 2024 19:3400000Error: Exit with code 2: panic: runtime error: index out of range [9] with length 9 goroutine 1 [running]: main.main() /tmp/solution2078086732/main.go:30 +0x1a5stderr