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 22, 2021 15:56Yuriy LyfenkoYuriy LyfenkoScore: 103,437Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2021 16:0597,409536,766,057477,302,81702,224,128
2May 22, 2021 15:5697,989541,523,399480,143,95702,228,224
3May 22, 2021 16:05103,013556,359,086504,762,10102,232,320
4May 22, 2021 16:05103,437578,078,327506,842,20902,224,128
5May 22, 2021 15:56103,686564,148,369508,062,84902,228,224
6May 22, 2021 15:56104,620571,579,164512,635,96102,232,320