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 16:19Victor MerckléVictor MerckléScore: 27,408Success
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 16:1927,363142,440,279133,050,0001,031,0002,117,632stderr
2Aug 25, 2026 16:1927,364142,548,524133,051,0001,037,0002,117,632stderr
3Aug 25, 2026 16:1927,371142,546,875133,047,0001,074,0002,117,632stderr
4Aug 25, 2026 16:1927,373142,623,771133,113,0001,016,0002,117,632stderr
5Aug 25, 2026 16:1927,408142,675,989133,213,0001,089,0002,117,632stderr
6Aug 25, 2026 16:1927,414142,786,966133,209,0001,124,0002,117,632stderr
7Aug 25, 2026 16:1927,416142,769,291133,257,0001,082,0002,117,632stderr
8Aug 25, 2026 16:1927,418142,732,232133,256,0001,093,0002,117,632stderr
9Aug 25, 2026 16:1927,424142,854,772133,251,0001,129,0002,117,632stderr