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 13, 2021 12:20Sergey StreminSergey StreminError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2021 12:2000000Wrong answer: expected: 1009922777 got: 3 2 11 13 10 3 11 8 4 8 6 11 2 7 7 5 14 8 10 3 4 5 8 8 12 13 9 3 10 5 2 10 14 15 10 1 4 12 10 4 12 2 12 1 14 8 8 14 12 4 4 5 11 10 4 6 3 7 7 10 15 1 8 4 9 13 1 9 14 8 7 2 7 12 7 7 10 1 7 13 2 11 4 12 7 1 5 12 6...