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:08Josu San MartinJosu San MartinScore: 26,934Success
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:0926,856140,035,687130,419,0001,180,0002,113,536
2Aug 4, 2026 06:0926,869140,099,891130,457,0001,205,0002,113,536
3Aug 4, 2026 06:0926,907140,002,591130,568,0001,280,0002,113,536
4Aug 4, 2026 06:0926,921140,356,948130,647,0001,267,0002,113,536
5Aug 4, 2026 06:0926,934141,024,968130,710,0001,268,0002,113,536
6Aug 4, 2026 06:0926,944141,795,586130,772,0001,256,0002,113,536
7Aug 4, 2026 06:0926,995151,677,547131,264,0001,015,0002,113,536
8Aug 4, 2026 06:0927,419142,738,158133,092,0001,262,0002,113,536
9Aug 4, 2026 06:0928,416147,706,846137,982,0001,258,0002,113,536