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 listOct 24, 2021 17:43evgenikwtevgenikwtError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2021 17:4300000Error: expected "560372188666 ", got "d=1,c=3,s=13 d=2,c=42,s=560 d=3,c=538,s=14542 d=4,c=5323,s=240714 d=5,c=52444,s=3540477 d=6,c=523944,s=49489819 d=7,c=5241927,s=660479734 d=8,c=52395156,s=8488119295 d=9,c=191780623,s=38771566968 560372188666 "