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 2, 2026 11:33Josu San MartinJosu San MartinScore: 32,160Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 11:3432,138168,238,175156,355,0001,125,0002,113,536
2Aug 2, 2026 11:3432,138168,925,516156,361,0001,119,0002,113,536
3Aug 2, 2026 11:3432,151167,797,335156,437,0001,105,0002,113,536
4Aug 2, 2026 11:3432,154167,984,887156,415,0001,140,0002,113,536
5Aug 2, 2026 11:3432,160168,135,202156,440,0001,148,0002,113,536
6Aug 2, 2026 11:3432,164167,872,827156,459,0001,146,0002,113,536
7Aug 2, 2026 11:3432,166168,375,545156,496,0001,121,0002,113,536
8Aug 2, 2026 11:3432,170167,629,273156,499,0001,135,0002,113,536
9Aug 2, 2026 11:3433,279173,859,823161,945,0001,126,0002,113,536