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 27, 2023 03:20matsuoka-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 27, 2023 03:2000000Error: expected "560368960280 ", got "2917254897461184576 55451206074302464 -6068960187854730547 55451206074302464 0 0 314 185 185 "
2Dec 27, 2023 03:2000000Error: expected "560376493986 ", got "-1208954028949631136 42784462749368320 3247817906361981235 42784462749368320 0 0 386 251 251 "
3Dec 27, 2023 03:2100000Error: expected "560376168611 ", got "2123461913987817726 7318637162987520 -6068404758402961223 7318637162987520 0 0 300 9 9 "