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:15Victor MerckléVictor MerckléScore: 27,982Success
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:1627,955145,993,060135,971,0001,009,0002,117,632stderr
2Aug 25, 2026 06:1627,957145,446,697135,982,0001,010,0002,117,632stderr
3Aug 25, 2026 06:1627,961145,379,639136,002,0001,010,0002,117,632stderr
4Aug 25, 2026 06:1627,962145,345,346136,005,0001,009,0002,117,632stderr
5Aug 25, 2026 06:1627,982145,558,527135,064,0002,051,0002,117,632stderr
6Aug 25, 2026 06:1627,989145,465,550136,140,0001,009,0002,117,632stderr
7Aug 25, 2026 06:1627,989145,587,324135,134,0002,014,0002,117,632stderr
8Aug 25, 2026 06:1628,013145,691,579136,257,0001,009,0002,117,632stderr
9Aug 25, 2026 06:1628,024145,745,336135,311,0002,009,0002,117,632stderr