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 7, 2021 18:47Yuriy 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 7, 2021 18:4700000Wrong answer: expected "530158321281 ", got "522321331034 "
2May 7, 2021 18:4700000Wrong answer: expected "530158500559 ", got "522215118510 "
3May 7, 2021 18:4700000Wrong answer: expected "530157051262 ", got "522169746453 "
4May 7, 2021 18:4700000Wrong answer: expected "530156664800 ", got "522197322309 "
5May 7, 2021 18:4700000Wrong answer: expected "530156459623 ", got "522270503816 "
6May 7, 2021 18:4800000Wrong answer: expected "530159040478 ", got "522169675458 "
7May 7, 2021 18:4800000Wrong answer: expected "530157679264 ", got "522351365428 "