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 27, 2026 15:40Kevin HeaveyKevin HeaveyScore: 62,886Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 15:4262,694317,357,808305,812,0001,390,00020,480
2Jul 27, 2026 15:4262,749318,280,822305,924,0001,549,00020,480
3Jul 27, 2026 15:4262,780319,094,826306,320,0001,303,0002,113,536
4Jul 27, 2026 15:4262,806319,933,793306,215,0001,536,00020,480
5Jul 27, 2026 15:4262,886318,899,099306,594,0001,549,00020,480
6Jul 27, 2026 15:4262,900318,253,283306,679,0001,534,0002,113,536
7Jul 27, 2026 15:4262,981318,733,129306,944,0001,667,0002,113,536
8Jul 27, 2026 15:4264,584327,076,963315,091,0001,373,00020,480
9Jul 27, 2026 15:4264,756327,392,716314,587,0002,718,0002,113,536