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 listJul 14, 2026 04:33Victor MerckléVictor MerckléScore: 30,707Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 04:3330,636158,228,541149,109,0001,008,0002,117,632stderr
2Jul 14, 2026 04:3330,657158,118,771148,188,0002,033,0002,117,632stderr
3Jul 14, 2026 04:3330,675158,355,550148,298,0002,012,0002,117,632stderr
4Jul 14, 2026 04:3330,694158,489,459149,392,0001,009,0002,117,632stderr
5Jul 14, 2026 04:3330,707159,055,297149,457,0001,010,0002,117,632stderr
6Jul 14, 2026 04:3330,756158,756,335149,700,0001,008,0002,117,632stderr
7Jul 14, 2026 04:3330,780158,992,492149,812,0001,010,0002,117,632stderr
8Jul 14, 2026 04:3330,957159,818,877150,681,0001,010,0002,117,632stderr
9Jul 14, 2026 04:3330,965159,937,828150,723,0001,008,0002,117,632stderr