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 listAug 24, 2026 09:53flavio87flavio87Score: 29,345Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 09:5429,327152,110,939142,598,0001,105,0002,113,536
2Aug 24, 2026 09:5429,328152,028,029142,613,0001,097,0002,113,536
3Aug 24, 2026 09:5429,340152,215,738142,665,0001,101,0002,113,536
4Aug 24, 2026 09:5429,343152,145,944142,683,0001,100,0002,113,536
5Aug 24, 2026 09:5429,345152,199,055142,680,0001,115,0002,113,536
6Aug 24, 2026 09:5429,346152,150,536142,697,0001,101,0002,113,536
7Aug 24, 2026 09:5429,357152,215,162142,733,0001,118,0002,113,536
8Aug 24, 2026 09:5429,357152,270,739142,748,0001,104,0002,113,536
9Aug 24, 2026 09:5433,255171,316,461161,843,0001,108,0002,113,536