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 8, 2021 21:49Andrey TsvetkovAndrey TsvetkovError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 8, 2021 21:4900000Wrong answer: expected "530158029247 ", got "371683 "
2May 8, 2021 22:0400000Wrong answer: expected "530156996876 ", got "764260 "
3May 8, 2021 22:1900000Wrong answer: expected "530157517371 ", got "1116961 "
4May 9, 2021 15:2300000Wrong answer: expected "530158464852 ", got "605078 "
5May 9, 2021 15:2500000Wrong answer: expected "530156531785 ", got "136333 "
6May 9, 2021 17:4300000Wrong answer: expected "530158334904 ", got "85049 "