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 6, 2021 20:31Yuriy 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 6, 2021 20:3100000Wrong answer: expected "530157172763 ", got "520862330282 "
2May 6, 2021 20:3200000Wrong answer: expected "530159199882 ", got "520975090148 "
3May 6, 2021 20:3200000Wrong answer: expected "530155423795 ", got "521003429873 "
4May 6, 2021 20:3400000Wrong answer: expected "530157513409 ", got "520849580877 "
5May 6, 2021 20:3600000Wrong answer: expected "530157367383 ", got "520920618964 "