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 4, 2022 15:49Robert BurkeRobert BurkeScore: 55,387Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 4, 2022 15:4952,962326,103,164259,515,45202,256,896
2Oct 4, 2022 15:4953,915327,042,677264,181,13702,179,072
3Oct 4, 2022 15:4954,444338,053,777266,773,35502,179,072
4Oct 4, 2022 15:4955,368290,756,183270,301,0001,001,0002,437,120
5Oct 4, 2022 15:4955,372293,869,905270,321,0001,001,0002,535,424
6Oct 4, 2022 15:4955,373295,457,767270,328,0001,001,0002,535,424
7Oct 4, 2022 15:4955,387294,169,085270,397,0001,001,0002,445,312
8Oct 4, 2022 15:4955,389296,308,573269,410,0001,995,0002,441,216
9Oct 4, 2022 15:4955,442296,811,353269,670,0001,997,0002,281,472
10Oct 4, 2022 15:4955,679295,727,815270,827,0001,998,0002,449,408
11Oct 4, 2022 15:4955,947294,183,999272,137,0002,001,0002,449,408
12Oct 4, 2022 15:4964,749343,254,537316,268,0001,000,0002,281,472