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 5, 2021 02:18Yuriy 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 5, 2021 02:1800000Wrong answer: expected "530156788327 ", got "106032054068 "
2May 5, 2021 02:1800000Wrong answer: expected "530156596367 ", got "106031744162 "
3May 5, 2021 02:1900000Wrong answer: expected "530158236146 ", got "106032719213 "
4May 5, 2021 20:5000000Wrong answer: expected "530157411841 ", got "106033172244 "