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 11, 2021 16:02Dmitry DolgopolovDmitry DolgopolovScore: 180,179Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2021 16:02178,853940,525,322876,381,23302,183,168
2Jun 11, 2021 16:01179,482934,417,140879,463,88702,174,976
3Jun 11, 2021 16:01179,539940,820,706879,742,26202,170,880
4Jun 11, 2021 16:02180,179953,387,642882,875,69502,183,168
5Jun 11, 2021 16:01182,481948,866,347894,159,05902,183,168
6Jun 11, 2021 16:02183,960973,877,689901,403,20602,179,072