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 20:30Josu San MartinJosu San MartinScore: 30,037Success
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 20:3130,016157,145,983145,961,0001,119,0002,113,536
2Aug 2, 2026 20:3130,019157,600,634145,964,0001,131,0002,113,536
3Aug 2, 2026 20:3130,023157,218,134145,988,0001,125,0002,113,536
4Aug 2, 2026 20:3130,033157,230,776146,044,0001,122,0002,113,536
5Aug 2, 2026 20:3130,037157,181,981146,057,0001,126,0002,113,536
6Aug 2, 2026 20:3130,043157,166,400146,085,0001,126,0002,113,536
7Aug 2, 2026 20:3130,329170,516,340147,428,0001,188,0002,113,536
8Aug 2, 2026 20:3130,374159,684,133147,694,0001,142,0002,113,536
9Aug 2, 2026 20:3130,444159,316,278148,052,0001,126,0002,113,536