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 listOct 19, 2025 02:53Marco BarboneMarco BarboneScore: 890,069Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2025 02:53889,7454,381,322,3784,357,752,0001,998,0002,424,832
2Oct 19, 2025 02:53890,0694,390,257,1674,361,340,00002,273,280
3Oct 19, 2025 02:53890,3174,388,782,0474,360,553,0001,998,0002,273,280