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:44Robert BurkeRobert BurkeScore: 55,381Success
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:4452,971322,560,825259,558,17302,183,168
2Oct 4, 2022 15:4452,971335,091,466259,559,08202,195,456
3Oct 4, 2022 15:4453,735328,599,956263,301,53502,179,072
4Oct 4, 2022 15:4455,373298,817,910270,327,0001,001,0002,281,472
5Oct 4, 2022 15:4455,374292,922,015271,334,00002,281,472
6Oct 4, 2022 15:4455,375293,788,451270,337,0001,001,0002,441,216
7Oct 4, 2022 15:4455,381293,872,438270,367,0001,001,0002,281,472
8Oct 4, 2022 15:4455,417297,122,310269,548,0001,996,0002,281,472
9Oct 4, 2022 15:4455,665294,615,026270,760,0001,998,0002,449,408
10Oct 4, 2022 15:4455,677297,271,170270,817,0001,998,0002,449,408
11Oct 4, 2022 15:4455,779293,889,113272,318,0001,001,0002,441,216
12Oct 4, 2022 15:4456,784300,662,874277,240,0001,000,0002,281,472