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 14:22Josu San MartinJosu San MartinScore: 30,659Success
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 14:2330,558159,704,716148,605,0001,131,0002,113,536
2Aug 2, 2026 14:2330,576160,659,936148,697,0001,126,0002,113,536
3Aug 2, 2026 14:2330,580159,927,182148,706,0001,136,0002,113,536
4Aug 2, 2026 14:2330,598160,019,420148,814,0001,118,0002,113,536
5Aug 2, 2026 14:2330,659160,362,365149,101,0001,131,0002,113,536
6Aug 2, 2026 14:2330,837161,049,103149,970,0001,132,0002,113,536
7Aug 2, 2026 14:2330,843161,321,868150,003,0001,132,0002,113,536
8Aug 2, 2026 14:2330,908161,438,566150,338,0001,115,0002,113,536
9Aug 2, 2026 14:2331,106162,422,729151,300,0001,121,0002,113,536