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 18:10Andrey 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 9, 2021 18:1000000Wrong answer: expected "530157765714 ", got "5213680 "
2May 9, 2021 18:1000000Wrong answer: expected "530156954560 ", got "3705444 "
3May 9, 2021 18:1100000Wrong answer: expected "530157373928 ", got "3836709 "
4May 9, 2021 18:1100000Wrong answer: expected "530157122860 ", got "1483477 "
5May 9, 2021 18:2100000Wrong answer: expected "530157066603 ", got "36047 "
6May 9, 2021 20:1000000Wrong answer: expected "530157609585 ", got "4563126 "
7May 11, 2021 16:5700000Wrong answer: expected "530158361091 ", got "6931498 "