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 2, 2026 14:29Josu San MartinJosu San MartinScore: 30,584Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 14:3030,574159,846,383148,695,0001,119,0002,113,536
2Aug 2, 2026 14:3030,575160,570,266148,697,0001,124,0002,113,536
3Aug 2, 2026 14:3030,576159,918,567148,712,0001,113,0002,113,536
4Aug 2, 2026 14:3030,579159,912,683148,707,0001,132,0002,113,536
5Aug 2, 2026 14:3030,584160,630,964148,719,0001,147,0002,113,536
6Aug 2, 2026 14:3030,589159,960,331148,741,0001,147,0002,113,536
7Aug 2, 2026 14:3030,594160,075,944148,798,0001,117,0002,113,536
8Aug 2, 2026 14:3030,634160,899,876148,994,0001,116,0002,113,536
9Aug 2, 2026 14:3030,664160,251,228149,024,0001,232,0002,113,536