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 11, 2021 22:42Andrey 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 11, 2021 22:4200000Wrong answer: expected "530156058101 ", got "32241093757 "
2May 11, 2021 22:5000000Wrong answer: expected "530155527815 ", got "32240989126 "
3May 11, 2021 22:5000000Wrong answer: expected "530157190648 ", got "32241337838 "
4May 11, 2021 22:5000000Wrong answer: expected "530157961103 ", got "32241528024 "
5May 11, 2021 22:5000000Wrong answer: expected "530158789543 ", got "32241315342 "
6May 11, 2021 22:5000000Wrong answer: expected "530155305688 ", got "32240827615 "
7May 11, 2021 22:5000000Wrong answer: expected "530156200166 ", got "32241058200 "
8May 11, 2021 23:0900000Wrong answer: expected "530157765925 ", got "32241567199 "