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 listJul 25, 2021 16:22Mikhail ShirokovMikhail ShirokovScore: 4,105,497Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 25, 2021 16:224,103,69620,174,414,93520,108,112,10902,281,472
2Jul 25, 2021 16:224,105,49720,171,579,70820,116,935,81802,273,280
3Jul 25, 2021 16:224,168,51920,484,952,24620,425,744,96602,281,472