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 2, 2026 22:29Josu San MartinJosu San MartinScore: 30,381Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 22:2930,360158,821,565146,635,0002,132,0002,113,536
2Aug 2, 2026 22:2930,362159,470,481146,617,0002,158,0002,113,536
3Aug 2, 2026 22:2930,372159,669,822146,672,0002,155,0002,113,536
4Aug 2, 2026 22:2930,373158,764,746146,744,0002,084,0002,113,536
5Aug 2, 2026 22:2930,381158,961,638146,720,0002,149,0002,113,536
6Aug 2, 2026 22:2930,392159,002,732146,802,0002,120,0002,113,536
7Aug 2, 2026 22:2930,456159,243,072146,977,0002,260,0002,113,536
8Aug 2, 2026 22:2930,457159,200,612147,205,0002,039,0002,113,536
9Aug 2, 2026 22:2930,543160,469,232147,441,0002,221,0002,113,536