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 24, 2026 18:16Victor MerckléVictor MerckléScore: 29,261Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 18:1628,865149,916,646139,417,0002,024,0002,117,632stderr
2Aug 24, 2026 18:1628,889150,632,415139,506,0002,052,0002,117,632stderr
3Aug 24, 2026 18:1628,891149,864,625139,544,0002,024,0002,117,632stderr
4Aug 24, 2026 18:1629,061151,516,083140,355,0002,048,0002,117,632stderr
5Aug 24, 2026 18:1629,261151,702,619141,368,0002,012,0002,117,632stderr
6Aug 24, 2026 18:1629,304152,807,540141,567,0002,025,0002,117,632stderr
7Aug 24, 2026 18:1629,819158,891,639145,105,0001,009,0002,117,632stderr
8Aug 24, 2026 18:1629,965159,857,751144,701,0002,128,0002,117,632stderr
9Aug 24, 2026 18:1630,203161,180,574145,908,0002,089,0002,117,632stderr