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 02:29Josu San MartinJosu San MartinScore: 27,087Success
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 02:2927,028141,441,263131,190,0001,252,0002,113,536
2Aug 4, 2026 02:2927,060141,056,864131,336,0001,259,0002,113,536
3Aug 4, 2026 02:2927,068142,237,379131,383,0001,253,0002,113,536
4Aug 4, 2026 02:2927,078141,161,310131,680,0001,007,0002,113,536
5Aug 4, 2026 02:2927,087140,892,661131,459,0001,272,0002,113,536
6Aug 4, 2026 02:2927,092141,195,500131,492,0001,263,0002,113,536
7Aug 4, 2026 02:2927,093141,216,075131,696,0001,062,0002,113,536
8Aug 4, 2026 02:2927,094142,399,577131,486,0001,276,0002,113,536
9Aug 4, 2026 02:2927,761144,183,714134,767,0001,265,0002,113,536