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 20:11Josu San MartinJosu San MartinScore: 30,766Success
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 20:1130,725161,998,501149,446,0001,111,0002,113,536
2Aug 2, 2026 20:1130,738161,395,245149,483,0001,134,0002,113,536
3Aug 2, 2026 20:1130,745160,782,915149,515,0001,140,0002,113,536
4Aug 2, 2026 20:1130,746160,653,741149,531,0001,127,0002,113,536
5Aug 2, 2026 20:1130,766161,517,621149,613,0001,144,0002,113,536
6Aug 2, 2026 20:1130,771161,080,289149,635,0001,144,0002,113,536
7Aug 2, 2026 20:1130,776160,930,789149,675,0001,130,0002,113,536
8Aug 2, 2026 20:1130,778162,441,002149,685,0001,132,0002,113,536
9Aug 2, 2026 20:1130,787161,602,145149,717,0001,141,0002,113,536