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 listMay 9, 2021 19:52Yuriy 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
1May 9, 2021 19:5200000exit with code 2: panic: runtime error: index out of range [8] with length 8 goroutine 1 [running]: main.main() /tmp/checker732142469/solution/main.go:101 +0x52e
2May 9, 2021 19:5200000exit with code 2: panic: runtime error: index out of range [8] with length 8 goroutine 1 [running]: main.main() /tmp/checker900383225/solution/main.go:101 +0x52e
3May 9, 2021 19:5200000exit with code 2: panic: runtime error: index out of range [8] with length 8 goroutine 1 [running]: main.main() /tmp/checker218284717/solution/main.go:101 +0x52e