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 listMay 11, 2026 16:14Victor MerckléVictor MerckléScore: 109,429Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 16:15109,320545,424,607533,492,0002,178,0002,113,536
2May 11, 2026 16:15109,331547,797,659533,581,0002,144,0002,113,536
3May 11, 2026 16:15109,362545,814,581533,843,0002,032,0002,113,536
4May 11, 2026 16:15109,390544,803,822533,876,0002,139,0002,113,536
5May 11, 2026 16:15109,429546,873,410534,140,0002,065,0002,113,536
6May 11, 2026 16:15109,433544,952,598534,180,0002,042,0002,113,536
7May 11, 2026 16:15109,488548,203,041534,303,0002,193,0002,113,536
8May 11, 2026 16:15110,306549,417,612539,497,0001,003,0002,113,536
9May 11, 2026 16:15110,360549,679,161538,761,0002,005,0002,113,536