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 14:24Josu San MartinJosu San MartinScore: 25,506Success
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 14:2425,191132,693,551122,182,0001,256,0002,113,536
2Aug 4, 2026 14:2425,198133,409,614122,211,0001,260,0002,113,536
3Aug 4, 2026 14:2425,215131,955,081122,288,0001,269,0002,113,536
4Aug 4, 2026 14:2425,252132,151,603122,470,0001,266,0002,113,536
5Aug 4, 2026 14:2425,506134,099,893123,718,0001,264,0002,113,536
6Aug 4, 2026 14:2425,568134,395,413124,280,0001,006,0002,113,536
7Aug 4, 2026 14:2425,715134,503,121124,983,0001,024,0002,113,536
8Aug 4, 2026 14:2426,339138,136,716127,805,0001,260,0002,113,536
9Aug 4, 2026 14:2430,500158,526,766148,193,0001,260,0002,113,536