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:03nikola-kovrizhnynikola-kovrizhnyScore: 742,655Success
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:03742,6063,700,756,5383,638,767,68902,301,952
2Jun 21, 2023 19:03742,6553,700,124,0213,639,010,86802,277,376
3Jun 21, 2023 19:03742,7293,704,693,9223,639,373,90802,273,280