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 listJun 21, 2023 19:12nikola-kovrizhnynikola-kovrizhnyScore: 862,137Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2023 19:12862,1294,289,644,6374,224,433,25802,281,472
2Jun 21, 2023 19:12862,1374,282,088,7444,224,470,99202,273,280
3Jun 21, 2023 19:12862,1994,288,863,3164,224,773,46402,273,280