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:32Josu San MartinJosu San MartinScore: 27,098Success
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:3327,006140,845,968131,081,0001,252,0002,113,536
2Aug 4, 2026 02:3327,067141,736,879131,370,0001,261,0002,113,536
3Aug 4, 2026 02:3327,069141,399,781131,380,0001,260,0002,113,536
4Aug 4, 2026 02:3327,071141,738,267131,400,0001,252,0002,113,536
5Aug 4, 2026 02:3327,098141,818,221131,524,0001,261,0002,113,536
6Aug 4, 2026 02:3327,107141,374,641131,773,0001,053,0002,113,536
7Aug 4, 2026 02:3327,111142,074,872131,713,0001,132,0002,113,536
8Aug 4, 2026 02:3327,128141,370,240131,676,0001,254,0002,113,536
9Aug 4, 2026 02:3327,476143,109,897133,628,0001,006,0002,113,536