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 24, 2024 02:14matsuoka-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
1May 24, 2024 02:1400000Error: expected "560377332805 ", got "249999984 58350 15566649 -7539191116994095192 285 "
2May 24, 2024 02:1400000Error: expected "560380617266 ", got "249999984 58001 15566998 4403301272817633428 285 "
3May 24, 2024 02:1500000Error: expected "560378680030 ", got "249999984 58236 15566763 -1136431885327851894 285 "
4May 24, 2024 02:1600000Error: expected "560374256798 ", got "249999984 57746 15567253 3692006073614934918 285 "
5May 24, 2024 02:1600000Error: expected "560375671473 ", got "249999984 58278 15566721 -6708354342554126814 285 "