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 listOct 19, 2023 13:12Andrey LikhachevAndrey LikhachevScore: 2,758,654Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2023 13:122,757,54313,611,018,83813,511,959,77902,269,184
2Oct 19, 2023 13:122,758,65413,577,383,48513,517,404,42102,236,416
3Oct 19, 2023 13:122,784,98013,709,135,91413,646,400,00102,232,320