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 13:20Josu San MartinJosu San MartinScore: 32,949Success
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 13:2132,694170,399,276159,063,0001,140,0002,113,536
2Aug 2, 2026 13:2132,704170,364,185159,124,0001,128,0002,113,536
3Aug 2, 2026 13:2132,726170,384,933159,231,0001,128,0002,113,536
4Aug 2, 2026 13:2132,741171,181,254159,089,0001,343,0002,113,536
5Aug 2, 2026 13:2132,949172,168,568160,339,0001,113,0002,113,536
6Aug 2, 2026 13:2132,963172,360,819160,382,0001,140,0002,113,536
7Aug 2, 2026 13:2133,007172,520,526160,608,0001,129,0002,113,536
8Aug 2, 2026 13:2133,231173,676,093161,699,0001,136,0002,113,536
9Aug 2, 2026 13:2133,241172,915,731161,748,0001,135,0002,113,536