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 12:10Josu San MartinJosu San MartinScore: 25,698Success
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 12:1025,669134,124,428124,746,0001,034,0002,113,536
2Aug 4, 2026 12:1025,676134,231,768124,549,0001,264,0002,113,536
3Aug 4, 2026 12:1025,686134,104,342124,846,0001,020,0002,113,536
4Aug 4, 2026 12:1025,698135,061,900124,650,0001,274,0002,113,536
5Aug 4, 2026 12:1025,698134,318,649124,666,0001,258,0002,113,536
6Aug 4, 2026 12:1025,702134,993,017124,687,0001,257,0002,113,536
7Aug 4, 2026 12:1025,745135,139,165125,144,0001,011,0002,113,536
8Aug 4, 2026 12:1025,881135,853,801125,550,0001,271,0002,113,536
9Aug 4, 2026 12:1025,903136,037,540125,655,0001,270,0002,113,536