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 listDec 27, 2023 03:11matsuoka-601matsuoka-601Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2023 03:1100000Error: expected "560376772414 ", got "-3951751513044555768 23081944534155264 6266252638448489132 23081944534155264 0 0 294 2 2 "
2Dec 27, 2023 03:1200000Error: expected "560375044528 ", got "-4338861055383549799 39688568731074560 -8640175154611155734 39688568731074560 0 0 294 63 63 "
3Dec 27, 2023 03:2200000Error: expected "560381420776 ", got "-4689190418943861770 48414284410519552 2811528249645313258 48414284410519552 0 0 294 12 12 "