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 25, 2026 06:38Victor MerckléVictor MerckléScore: 30,396Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 06:3930,352157,253,217147,721,0001,008,0002,117,632stderr
2Aug 25, 2026 06:3930,369157,873,472147,804,0001,008,0002,117,632stderr
3Aug 25, 2026 06:3930,373157,192,723147,821,0001,009,0002,117,632stderr
4Aug 25, 2026 06:3930,387157,383,862147,891,0001,010,0002,117,632stderr
5Aug 25, 2026 06:3930,396157,351,249146,918,0002,023,0002,117,632stderr
6Aug 25, 2026 06:3930,406157,432,545147,983,0001,008,0002,117,632stderr
7Aug 25, 2026 06:3930,408157,434,334147,992,0001,009,0002,117,632stderr
8Aug 25, 2026 06:3930,546158,122,753148,667,0001,012,0002,117,632stderr
9Aug 25, 2026 06:3930,588158,367,989147,776,0002,108,0002,117,632stderr