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 listJun 11, 2024 16:57matsuoka-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
1Jun 11, 2024 16:5700000Error: expected "560376132636 ", got "249999984 0 15566898 20829397386330245 5181930362639626328 301 "
2Jun 11, 2024 16:5900000Error: expected "560378147251 ", got "249999984 0 15567230 11540564255047827 -1337396026739431021 301 "
3Jun 12, 2024 02:4400000Error: expected "560379299335 ", got "249999984 0 15566913 28429264713810039 479889012729682506 301 "