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:02matsuoka-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:0200000Error: expected "560375590973 ", got "-735505583970668911 -7523356828783241261 62768979942768736 62768979942768736 0 0 126 80 80 "
2Dec 24, 2023 18:0300000Error: expected "560376402809 ", got "-3521678135099566235 5689568311566306108 18859785517203673 18859785517203673 0 0 126 80 80 "