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 02:44matsuoka-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 02:4400000Error: expected "560375810318 ", got "-623454727277381573 7471337 -89634953966678741 9568256 0 0 339 149 108 "
2Dec 24, 2023 02:4500000Error: expected "560376812596 ", got "9120193000076204606 1310953 6122381877722151734 8978432 0 0 324 146 136 "
3Dec 24, 2023 02:4500000Error: expected "560374921491 ", got "-5711488981557431700 6815932 -8368600894165914274 7471104 0 0 324 124 108 "