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 listDec 26, 2023 10:04matsuoka-601matsuoka-601Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2023 10:0400000Error: expected "560382284433 ", got "9220452001665557238 45881009622810717 7760017857239819796 0 0 0 286 85 176 "
2Dec 26, 2023 10:0500000Error: expected "560379224904 ", got "-8425819222021745693 40532813263929358 5895809439346151716 0 0 0 283 203 151 "
3Dec 26, 2023 10:0500000Error: expected "560379263847 ", got "5583311344943616746 11540890660176124 -7866056322849630541 0 0 0 282 163 235 "