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 listJan 11, 2025 11:35Advait IyerAdvait IyerScore: 764,772Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2025 11:35764,6933,778,068,5083,742,997,0003,997,0002,285,568
2Jan 11, 2025 11:35764,7723,777,713,1743,743,386,0003,997,0002,498,560
3Jan 11, 2025 11:35764,8593,775,913,0293,745,811,0001,998,0002,502,656