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:10Kevin HeaveyKevin HeaveyScore: 62,225Success
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:3862,123314,424,821302,984,0001,420,00020,480
2Jul 27, 2026 15:3862,187314,751,801303,189,0001,528,00020,480
3Jul 27, 2026 15:3862,218315,000,253303,214,0001,659,00020,480
4Jul 27, 2026 15:3862,218315,658,855303,321,0001,549,00020,480
5Jul 27, 2026 15:3862,225314,951,506303,387,0001,516,00020,480
6Jul 27, 2026 15:3862,239315,021,343303,422,0001,553,00020,480
7Jul 27, 2026 15:3862,245315,023,317303,352,0001,650,0002,113,536
8Jul 27, 2026 15:3862,259315,390,316303,274,0001,798,00020,480
9Jul 27, 2026 15:3862,395315,797,541303,000,0002,736,0002,113,536