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 14:25Kevin HeaveyKevin HeaveyScore: 62,387Success
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 14:5762,050316,155,527295,213,0008,836,0002,113,536
2Jul 27, 2026 14:5762,266315,172,752295,586,0009,522,0002,113,536
3Jul 27, 2026 14:5762,341315,591,729296,657,0008,814,0002,113,536
4Jul 27, 2026 14:5762,363315,540,097295,487,00010,096,0002,113,536
5Jul 27, 2026 14:5762,387316,603,038294,988,00010,710,00020,480
6Jul 27, 2026 14:5762,399316,263,078296,343,0009,415,00020,480
7Jul 27, 2026 14:5762,522316,490,690295,064,00011,296,00020,480
8Jul 27, 2026 14:5762,683317,451,393295,601,00011,546,0002,113,536
9Jul 27, 2026 14:5763,188320,491,038296,270,00013,353,00020,480