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 4, 2026 06:45Josu San MartinJosu San MartinScore: 27,576Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 06:4527,538144,084,130133,932,0001,008,0002,113,536
2Aug 4, 2026 06:4527,545143,470,645133,963,0001,009,0002,113,536
3Aug 4, 2026 06:4527,546144,148,827133,968,0001,008,0002,113,536
4Aug 4, 2026 06:4527,552143,495,639133,998,0001,008,0002,113,536
5Aug 4, 2026 06:4527,576143,619,647134,118,0001,008,0002,113,536
6Aug 4, 2026 06:4527,577143,616,747134,120,0001,009,0002,113,536
7Aug 4, 2026 06:4527,578146,387,913134,129,0001,008,0002,113,536
8Aug 4, 2026 06:4527,588143,714,594134,178,0001,008,0002,113,536
9Aug 4, 2026 06:4527,713144,883,943134,788,0001,009,0002,113,536