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 3, 2026 12:43Josu San MartinJosu San MartinScore: 32,973Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 12:4332,938170,540,485160,398,0001,003,0002,113,536
2Aug 3, 2026 12:4332,942170,565,749160,411,0001,006,0002,113,536
3Aug 3, 2026 12:4332,943170,531,785160,393,0001,032,0002,113,536
4Aug 3, 2026 12:4332,973170,189,643160,300,0001,269,0002,113,536
5Aug 3, 2026 12:4332,973170,733,675160,307,0001,263,0002,113,536
6Aug 3, 2026 12:4332,975170,186,710160,538,0001,044,0002,113,536
7Aug 3, 2026 12:4333,073171,134,600161,021,0001,037,0002,113,536
8Aug 3, 2026 12:4333,580174,098,568163,289,0001,253,0002,113,536
9Aug 3, 2026 12:4334,469178,923,817167,884,0001,017,0002,113,536