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 4, 2021 11:09Yurkov AlekseyYurkov AlekseyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2021 11:0900000Wrong answer: expected "530158533394 ", got "84415 "
2May 4, 2021 11:1000000Wrong answer: expected "530156726050 ", got "908756 "
3May 4, 2021 11:1000000Wrong answer: expected "530155402893 ", got "704896 "
4May 4, 2021 11:1100000Wrong answer: expected "530154817068 ", got "407352 "
5May 17, 2021 07:5200000Wrong answer: expected "530156979571 ", got "13323 "