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 12:27Josu San MartinJosu San MartinScore: 25,403Success
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 12:2725,358133,339,343123,222,0001,036,0002,113,536
2Aug 4, 2026 12:2725,364133,350,091123,027,0001,257,0002,113,536
3Aug 4, 2026 12:2725,373132,752,902123,062,0001,269,0002,113,536
4Aug 4, 2026 12:2725,391133,461,887123,411,0001,006,0002,113,536
5Aug 4, 2026 12:2725,403133,478,400123,216,0001,262,0002,113,536
6Aug 4, 2026 12:2725,404133,537,456123,223,0001,259,0002,113,536
7Aug 4, 2026 12:2725,412133,534,870123,518,0001,005,0002,113,536
8Aug 4, 2026 12:2725,431133,589,337123,565,0001,050,0002,113,536
9Aug 4, 2026 12:2725,841135,723,448125,350,0001,271,0002,113,536