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 15:50Josu San MartinJosu San MartinScore: 30,644Success
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 15:5130,581160,630,810148,718,0001,130,0002,113,536
2Aug 2, 2026 15:5130,620159,996,746148,928,0001,110,0002,113,536
3Aug 2, 2026 15:5130,626160,835,477148,937,0001,133,0002,113,536
4Aug 2, 2026 15:5130,636160,834,833148,999,0001,122,0002,113,536
5Aug 2, 2026 15:5130,644160,258,015149,024,0001,134,0002,113,536
6Aug 2, 2026 15:5130,656160,207,303149,092,0001,125,0002,113,536
7Aug 2, 2026 15:5130,673161,012,434149,165,0001,134,0002,113,536
8Aug 2, 2026 15:5130,675160,390,377149,170,0001,140,0002,113,536
9Aug 2, 2026 15:5132,984171,542,784160,352,0001,272,0002,113,536