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 8, 2026 09:53Victor MerckléVictor MerckléScore: 31,742Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 09:5431,565162,603,766153,663,0001,009,0002,117,632stderr
2Jul 8, 2026 09:5431,695163,327,178154,301,0001,008,0002,117,632stderr
3Jul 8, 2026 09:5431,706163,273,083153,319,0002,045,0002,117,632stderr
4Jul 8, 2026 09:5431,720163,791,862154,422,0001,010,0002,117,632stderr
5Jul 8, 2026 09:5431,742163,434,096153,506,0002,030,0002,117,632stderr
6Jul 8, 2026 09:5431,815163,773,141154,886,0001,011,0002,117,632stderr
7Jul 8, 2026 09:5431,826163,818,774154,938,0001,011,0002,117,632stderr
8Jul 8, 2026 09:5431,845163,852,964154,023,0002,019,0002,117,632stderr
9Jul 8, 2026 09:5431,920164,779,754155,398,0001,011,0002,117,632stderr