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 9, 2026 09:12Victor MerckléVictor MerckléScore: 32,931Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 09:1332,791168,872,823159,671,0001,008,0002,117,632stderr
2Jul 9, 2026 09:1332,794168,596,892159,685,0001,009,0002,117,632stderr
3Jul 9, 2026 09:1332,817168,637,200159,797,0001,007,0002,117,632stderr
4Jul 9, 2026 09:1332,898169,368,918160,197,0001,008,0002,117,632stderr
5Jul 9, 2026 09:1332,931169,305,219160,358,0001,006,0002,117,632stderr
6Jul 9, 2026 09:1332,980169,510,215160,595,0001,007,0002,117,632stderr
7Jul 9, 2026 09:1333,051169,795,584159,948,0002,003,0002,117,632stderr
8Jul 9, 2026 09:1333,215170,631,340161,751,0001,006,0002,117,632stderr
9Jul 9, 2026 09:1333,483171,951,771163,065,0001,006,0002,117,632stderr