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 listFeb 6, 2025 09:42Oleg KovalovOleg KovalovScore: 1,316,918Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 6, 2025 09:421,316,1176,475,144,4916,320,036,000128,939,0002,420,736
2Feb 6, 2025 09:421,316,9186,482,909,1716,296,998,000155,900,0002,273,280
3Feb 6, 2025 09:421,319,5996,491,240,3126,302,134,000163,899,0002,273,280