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 18:36Robert 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 18:3652,965323,133,914259,526,07802,183,168
2Oct 4, 2022 18:3652,965318,750,245259,529,27402,301,952
3Oct 4, 2022 18:3654,455326,584,273266,827,53902,256,896
4Oct 4, 2022 18:3655,356293,107,972270,242,0001,000,0002,281,472
5Oct 4, 2022 18:3655,377295,447,770270,345,0001,001,0002,281,472
6Oct 4, 2022 18:3655,377298,535,967270,348,0001,001,0002,273,280
7Oct 4, 2022 18:3655,387297,479,535270,397,0001,001,0002,445,312
8Oct 4, 2022 18:3655,392296,828,243270,419,0001,001,0002,441,216
9Oct 4, 2022 18:3655,412291,316,716269,521,0001,996,0002,535,424
10Oct 4, 2022 18:3655,412298,138,244270,518,0001,001,0002,445,312
11Oct 4, 2022 18:3655,488294,707,036270,894,000999,0002,281,472
12Oct 4, 2022 18:3655,898293,062,617271,901,0001,999,0002,281,472