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 3, 2026 03:35Josu San MartinJosu San MartinScore: 28,968Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 03:3628,933150,873,678140,511,0001,263,0002,113,536
2Aug 3, 2026 03:3628,937150,141,154140,535,0001,260,0002,113,536
3Aug 3, 2026 03:3628,946150,940,491140,578,0001,262,0002,113,536
4Aug 3, 2026 03:3628,960150,917,073140,638,0001,269,0002,113,536
5Aug 3, 2026 03:3628,968150,380,741140,744,0001,200,0002,113,536
6Aug 3, 2026 03:3628,986151,076,096140,972,0001,063,0002,113,536
7Aug 3, 2026 03:3628,994152,346,103140,809,0001,266,0002,113,536
8Aug 3, 2026 03:3629,234151,580,895142,240,0001,008,0002,113,536
9Aug 3, 2026 03:3629,607153,514,837143,794,0001,281,0002,113,536