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 listDec 24, 2023 13:15matsuoka-601matsuoka-601Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2023 13:1500000Error: expected "560379969188 ", got "8328789964520811172 50103035493154929 -8105604569303510371 7012352 0 0 323 91 209 "
2Dec 24, 2023 13:1500000Error: expected "560374961956 ", got "4639340893630025035 29836605237035016 -188699150766959376 2162688 0 0 325 168 180 "
3Dec 24, 2023 13:1500000Error: expected "560374838105 ", got "-7055015634951100935 8726415774515248 207896544492586878 11206656 0 0 339 138 192 "