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:33Josu San MartinJosu San MartinScore: 32,264Success
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:3432,238167,998,124156,843,0001,128,0002,113,536
2Aug 2, 2026 14:3432,241168,101,127156,881,0001,104,0002,113,536
3Aug 2, 2026 14:3432,259168,079,262156,952,0001,118,0002,113,536
4Aug 2, 2026 14:3432,260168,103,947156,959,0001,117,0002,113,536
5Aug 2, 2026 14:3432,264168,179,630156,971,0001,127,0002,113,536
6Aug 2, 2026 14:3432,271168,250,943157,011,0001,119,0002,113,536
7Aug 2, 2026 14:3432,280168,589,222157,061,0001,115,0002,113,536
8Aug 2, 2026 14:3432,319169,130,178157,218,0001,146,0002,113,536
9Aug 2, 2026 14:3432,375178,061,270157,462,0001,178,0002,113,536