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 3, 2021 18:33Yuriy 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 3, 2021 18:3300000Wrong answer: expected "530156861405 ", got "106033389235 "
2May 3, 2021 18:3400000Wrong answer: expected "530158041252 ", got "106031496152 "
3May 3, 2021 20:3300000Wrong answer: expected "530156055933 ", got "106029903079 "
4May 4, 2021 22:5600000Wrong answer: expected "530155195284 ", got "106030008133 "
5May 4, 2021 22:5600000Wrong answer: expected "530157438805 ", got "106032232977 "
6May 5, 2021 00:5400000Wrong answer: expected "530157500485 ", got "106030514602 "