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 3, 2026 15:45Josu San MartinJosu San MartinScore: 28,418Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 15:4628,384147,539,192137,823,0001,261,0002,113,536
2Aug 3, 2026 15:4628,413148,324,942137,956,0001,271,0002,113,536
3Aug 3, 2026 15:4628,414148,375,469137,980,0001,251,0002,113,536
4Aug 3, 2026 15:4628,414148,797,304137,969,0001,262,0002,113,536
5Aug 3, 2026 15:4628,418148,379,002138,201,0001,048,0002,113,536
6Aug 3, 2026 15:4628,426147,740,969138,010,0001,280,0002,113,536
7Aug 3, 2026 15:4628,434147,857,495138,060,0001,270,0002,113,536
8Aug 3, 2026 15:4628,475147,983,565138,267,0001,265,0002,113,536
9Aug 3, 2026 15:4628,857150,523,091140,136,0001,267,0002,113,536