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 22:41Josu San MartinJosu San MartinScore: 29,631Success
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 22:4229,591155,806,584143,866,0001,131,0002,113,536
2Aug 2, 2026 22:4229,594155,104,932143,882,0001,130,0002,113,536
3Aug 2, 2026 22:4229,611155,155,914143,967,0001,129,0002,113,536
4Aug 2, 2026 22:4229,621156,088,717144,011,0001,135,0002,113,536
5Aug 2, 2026 22:4229,631156,649,467144,071,0001,122,0002,113,536
6Aug 2, 2026 22:4229,635155,934,967144,079,0001,135,0002,113,536
7Aug 2, 2026 22:4229,638156,011,974144,101,0001,128,0002,113,536
8Aug 2, 2026 22:4229,647155,388,120144,150,0001,122,0002,113,536
9Aug 2, 2026 22:4230,176157,819,600146,748,0001,117,0002,113,536