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: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 24, 2023 04:0400000Error: expected "560379829837 ", got "-5287406587587017524 27866349126549581 -6754189607203302999 4718592 0 0 322 181 179 "
2Dec 24, 2023 16:5200000Error: expected "560380363352 ", got "-832167855347551285 64177200930422950 8605606085143696332 11796480 0 0 322 129 162 "
3Dec 24, 2023 16:5500000Error: expected "560377357115 ", got "2025905506692665096 57421913165791235 9033491053929596110 9240576 0 0 322 166 165 "
4Dec 24, 2023 16:5700000Error: expected "560380086930 ", got "8487888053764048894 55732917280112856 -8247120714931020012 3080192 0 0 322 119 188 "