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:47matsuoka-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:4700000Error: expected "560382813328 ", got "5069451960712766763 7501309118865735713 6408589923980465396 829225283663364096 0 0 291 156 121 "
2Dec 24, 2023 16:4900000Error: expected "560375961874 ", got "-5742526514892140111 -9187342400161316638 -1781534889439342273 -5379268278371942400 0 0 294 128 165 "
3Dec 24, 2023 16:5500000Error: expected "560383288750 ", got "-6965246365850492570 6727533725218766886 7431748385201202957 -2692026675239583744 0 0 294 163 136 "