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 listSep 2, 2022 20:33Eugene ZhydzetskiEugene ZhydzetskiScore: 2,472,440Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2022 20:332,463,68612,126,657,64812,072,061,38302,228,224
2Sep 2, 2022 20:332,472,44012,180,470,53312,114,955,17202,310,144
3Sep 2, 2022 20:332,473,12612,185,910,38112,118,317,80602,314,240