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 listSep 20, 2022 16:16Bernard TeoBernard TeoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2022 16:1600000Error: expected "560378238395 ", got "208 211 48 48 48 211 220 220 211 218 204 205 215 208 216 205 428 416 268 261 48 48 432 445 432 429 411 409 433 426 425 411 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 4240 3564 3685 3622 2899 2108 4374 4389 4365 4334 3152 3...