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 24, 2023 04:01matsuoka-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 24, 2023 04:0100000Error: expected "560381144000 ", got "6365726886564183743 57702597874221084 4575950728278592639 0 0 0 336 145 165 "
2Dec 24, 2023 04:0200000Error: expected "560376277229 ", got "6719789920055789173 42222208592642233 -2256274740730402220 0 0 0 336 104 194 "
3Dec 24, 2023 04:0300000Error: expected "560367390251 ", got "1615186227812485561 43910830815969407 4313862408837346722 0 0 0 336 86 163 "
4Dec 24, 2023 13:1200000Error: expected "560380284705 ", got "-1001422286023548497 25614587954790466 -2885421922801844461 0 0 0 336 152 143 "
5Dec 24, 2023 13:1200000Error: expected "560377784363 ", got "5216416917773160408 17733133989773344 5696357317602389459 0 0 0 336 170 134 "