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 10:43Josu San MartinJosu San MartinScore: 30,185Success
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 10:4330,114156,016,416146,295,0001,264,0002,113,536
2Aug 3, 2026 10:4330,134156,042,414146,403,0001,256,0002,113,536
3Aug 3, 2026 10:4330,141156,178,491146,665,0001,029,0002,113,536
4Aug 3, 2026 10:4330,146156,913,603146,710,0001,008,0002,113,536
5Aug 3, 2026 10:4330,185156,337,532146,655,0001,256,0002,113,536
6Aug 3, 2026 10:4330,200157,111,141146,728,0001,254,0002,113,536
7Aug 3, 2026 10:4330,234157,180,341147,098,0001,052,0002,113,536
8Aug 3, 2026 10:4330,327157,718,180147,349,0001,257,0002,113,536
9Aug 3, 2026 10:4330,589159,030,848148,618,0001,270,0002,113,536