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 03:30Victor MerckléVictor MerckléScore: 28,013Success
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 03:3127,886145,068,179135,633,0001,009,0002,117,632stderr
2Aug 25, 2026 03:3127,975145,453,531136,072,0001,010,0002,117,632stderr
3Aug 25, 2026 03:3127,997146,847,808135,172,0002,016,0002,117,632stderr
4Aug 25, 2026 03:3128,008145,678,761136,232,0001,010,0002,117,632stderr
5Aug 25, 2026 03:3128,013145,664,031136,257,0001,011,0002,117,632stderr
6Aug 25, 2026 03:3128,023145,666,948136,304,0001,009,0002,117,632stderr
7Aug 25, 2026 03:3128,027145,723,534136,325,0001,010,0002,117,632stderr
8Aug 25, 2026 03:3128,120146,198,984136,781,0001,010,0002,117,632stderr
9Aug 25, 2026 03:3128,137146,245,273135,846,0002,027,0002,117,632stderr