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 9, 2021 18:05Andrey TsvetkovAndrey TsvetkovError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2021 18:0500000Wrong answer: expected "530157141389 ", got "3263177 "
2May 9, 2021 18:0600000Wrong answer: expected "530155780120 ", got "947203 "
3May 9, 2021 18:0800000Wrong answer: expected "530157947797 ", got "321636 "
4May 9, 2021 18:0900000Wrong answer: expected "530157713127 ", got "9950586 "
5May 9, 2021 18:0900000Wrong answer: expected "530157390033 ", got "2884315 "