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 23, 2023 12:18matsuoka-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 23, 2023 12:1800000Error: expected "560376035754 ", got "1077525046652899609 458987 3386616716301539736 4718592 0 0 343 148 123 "
2Dec 23, 2023 12:2200000Error: expected "560372647783 ", got "-4533617012270004212 13500503 -7288270419870744928 786432 0 0 332 169 138 "
3Dec 23, 2023 12:2400000Error: expected "560374686708 ", got "-4408477928401836563 1310940 -1675802459637566266 15794176 0 0 332 188 178 "