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:24Andrei 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:2400000Wrong answer: expected: 1009998847 got: [12 0 0 0 9 0 0 0 2 0 0 0 14 0 0 0 8 0 0 0 14] [0 0 0 4 0 0 0 1 0 0 0 13 0 0 0 12 0 0 0 6 0] [0 0 13 0 0 0 4 0 0 0 4 0 0 0 15 0 0 0 7 0 0] [0 5 0 0 0 8 0 0 0 11 0 0 0 13 0 0 0 14 0 0 0] [9 0 0 0 2 0 0 0 3 0 0 0...