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 1, 2026 02:51Josu San MartinJosu San MartinScore: 35,966Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 02:5135,937186,232,246174,982,0001,110,0002,113,536
2Aug 1, 2026 02:5135,944186,345,886175,023,0001,103,0002,113,536
3Aug 1, 2026 02:5135,953186,382,197175,056,0001,118,0002,113,536
4Aug 1, 2026 02:5135,965186,408,122175,113,0001,117,0002,113,536
5Aug 1, 2026 02:5135,966187,065,996175,103,0001,132,0002,113,536
6Aug 1, 2026 02:5135,980186,380,588175,168,0001,134,0002,113,536
7Aug 1, 2026 02:5135,992186,744,885175,221,0001,141,0002,113,536
8Aug 1, 2026 02:5136,316188,815,325176,811,0001,140,0002,113,536
9Aug 1, 2026 02:5136,741190,979,901178,912,0001,123,0002,113,536