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 13:29matsuoka-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 13:2900000Error: expected "560379007202 ", got "-5007059216352034879 1971192435703808 -7341091387571661261 0 0 0 325 157 167 "
2Dec 24, 2023 13:2900000Error: expected "560377168408 ", got "-7382550501706421027 63614087782400001 -1784525574709807546 0 0 0 336 116 167 "
3Dec 24, 2023 13:2900000Error: expected "560375233429 ", got "-83046328371478860 63895824738156769 -4732646547561032383 0 0 0 323 141 161 "
4Dec 24, 2023 13:3000000Error: expected "560379613586 ", got "-5179952101682802301 18577636228595736 -7621118750540770175 0 0 0 327 186 196 "