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 20:25Yuriy LyfenkoYuriy LyfenkoError
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 20:2500000Wrong answer: expected "530155217984 ", got "-618769553 "
2May 12, 2021 20:2500000Wrong answer: expected "530157003002 ", got "774113289 "
3May 12, 2021 20:2500000Wrong answer: expected "530157838473 ", got "-2131955844 "
4May 12, 2021 20:2500000Wrong answer: expected "530155806505 ", got "904695417 "
5May 12, 2021 20:2500000Wrong answer: expected "530158764696 ", got "-1207073301 "
6May 13, 2021 15:4600000Wrong answer: expected "530157743312 ", got "211153943 "