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 12, 2021 20:22Yuriy 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 12, 2021 20:2200000Wrong answer: expected "530155816511 ", got "204836728 "
2May 12, 2021 20:2200000Wrong answer: expected "530156531540 ", got "-1585925897 "
3May 12, 2021 20:2200000Wrong answer: expected "530154942607 ", got "-1162077152 "
4May 12, 2021 20:2200000Wrong answer: expected "530156429310 ", got "-2023098524 "
5May 12, 2021 20:2300000Wrong answer: expected "530156025991 ", got "-1245150493 "
6May 12, 2021 20:2300000Wrong answer: expected "530156506266 ", got "673916866 "
7May 12, 2021 20:2300000Wrong answer: expected "530155349710 ", got "88223943 "
8May 12, 2021 20:2300000Wrong answer: expected "530155929224 ", got "1594295231 "