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 listJun 8, 2021 11:25Dmitry DolgopolovDmitry DolgopolovScore: 180,800Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2021 11:20180,112931,337,830882,549,56602,183,168
2Jun 8, 2021 11:25180,115939,223,223882,564,92502,179,072
3Jun 8, 2021 11:20180,303951,151,316883,486,70402,297,856
4Jun 8, 2021 11:25180,800941,172,212885,919,70402,179,072
5Jun 8, 2021 11:20184,639992,948,174904,729,13502,174,976
6Jun 8, 2021 11:25190,0291,003,183,596931,144,20402,301,952