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 00:01Victor MerckléVictor MerckléScore: 31,234Success
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 00:0131,117160,856,319150,429,0002,046,0002,117,632stderr
2Aug 25, 2026 00:0131,199161,966,664150,850,0002,027,0002,117,632stderr
3Aug 25, 2026 00:0131,202161,999,513151,885,0001,009,0002,117,632stderr
4Aug 25, 2026 00:0131,207161,298,537150,896,0002,023,0002,117,632stderr
5Aug 25, 2026 00:0131,234161,451,217151,031,0002,016,0002,117,632stderr
6Aug 25, 2026 00:0131,250161,547,058151,091,0002,035,0002,117,632stderr
7Aug 25, 2026 00:0131,257161,381,107151,145,0002,019,0002,117,632stderr
8Aug 25, 2026 00:0131,266161,664,563151,193,0002,012,0002,117,632stderr
9Aug 25, 2026 00:0131,335162,069,218152,533,0001,010,0002,117,632stderr