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 18:01matsuoka-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 18:0100000Error: expected "560379139806 ", got "8461380400672953534 8461380400672953534 69242990302855277 69242990302855277 0 0 194 80 80 "
2Dec 24, 2023 18:1100000Error: expected "560368969256 ", got "-1033561431712281156 -1033561431712281156 21956061800628230 21956061800628230 0 0 194 80 80 "