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 22:45Josu San MartinJosu San MartinScore: 31,796Success
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 22:4631,775165,580,997154,558,0001,143,0002,113,536
2Aug 2, 2026 22:4631,782165,655,008154,593,0001,141,0002,113,536
3Aug 2, 2026 22:4631,786165,512,084154,613,0001,143,0002,113,536
4Aug 2, 2026 22:4631,793165,611,490154,646,0001,144,0002,113,536
5Aug 2, 2026 22:4631,796165,727,806154,660,0001,145,0002,113,536
6Aug 2, 2026 22:4631,799165,607,210154,664,0001,154,0002,113,536
7Aug 2, 2026 22:4631,802165,529,944154,685,0001,148,0002,113,536
8Aug 2, 2026 22:4632,116167,176,545156,232,0001,137,0002,113,536
9Aug 2, 2026 22:4632,586169,488,938158,526,0001,147,0002,113,536