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 05:05Victor MerckléVictor MerckléScore: 28,895Success
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 05:0628,593148,492,373138,082,0002,027,0002,117,632stderr
2Aug 25, 2026 05:0628,686148,962,625138,546,0002,020,0002,117,632stderr
3Aug 25, 2026 05:0628,732149,145,568138,783,0002,008,0002,117,632stderr
4Aug 25, 2026 05:0628,776149,397,003138,953,0002,051,0002,117,632stderr
5Aug 25, 2026 05:0628,895149,963,474139,555,0002,035,0002,117,632stderr
6Aug 25, 2026 05:0629,013150,592,482140,102,0002,063,0002,117,632stderr
7Aug 25, 2026 05:0629,060151,473,776140,370,0002,024,0002,117,632stderr
8Aug 25, 2026 05:0629,157151,270,392140,788,0002,085,0002,117,632stderr
9Aug 25, 2026 05:0629,229151,595,692141,156,0002,069,0002,117,632stderr