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 listMay 12, 2021 11:06Andrei GrazhdankovAndrei GrazhdankovError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2021 11:0600000Wrong answer: expected: 1009798152 got: s: 7 c: 7 k 0 55 0 --- s: 4 c: 4 k 0 52 0 --- s: 9 c: 9 k 0 57 0 --- s: 9 c: 9 k 0 57 0 --- s: 15 c: 15 k 0 49 0 --- k 1 53 53 --- s: 11 c: 11 k 0 49 53 --- k 1 49 102 --- s: 8 c: 8 k 0 56 102 ---...