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 4, 2026 14:12Josu San MartinJosu San MartinScore: 25,337Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 14:1225,262132,842,157122,533,0001,252,0002,113,536
2Aug 4, 2026 14:1225,298133,796,459122,702,0001,259,0002,113,536
3Aug 4, 2026 14:1225,307133,195,591122,746,0001,263,0002,113,536
4Aug 4, 2026 14:1225,309132,331,729122,755,0001,262,0002,113,536
5Aug 4, 2026 14:1225,337133,194,587122,901,0001,254,0002,113,536
6Aug 4, 2026 14:1225,372133,357,254123,063,0001,261,0002,113,536
7Aug 4, 2026 14:1225,390133,565,137123,363,0001,050,0002,113,536
8Aug 4, 2026 14:1225,501134,045,549123,695,0001,260,0002,113,536
9Aug 4, 2026 14:1225,934136,146,333126,053,0001,025,0002,113,536