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 5, 2021 02:01Yuriy 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 5, 2021 02:0100000Wrong answer: expected "530156069351 ", got "106033263974 "
2May 5, 2021 02:1100000Wrong answer: expected "530156751050 ", got "106032438257 "
3May 5, 2021 02:1100000Wrong answer: expected "530154898397 ", got "106032549352 "
4May 5, 2021 02:1100000Wrong answer: expected "530156789625 ", got "106033732552 "
5May 5, 2021 02:1100000Wrong answer: expected "530159233497 ", got "106033184655 "
6May 5, 2021 02:1200000Wrong answer: expected "530157780934 ", got "106029062969 "
7May 5, 2021 02:1200000Wrong answer: expected "530156526420 ", got "106030511372 "
8May 5, 2021 02:1200000Wrong answer: expected "530155517865 ", got "106030932030 "