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 08:32Josu San MartinJosu San MartinScore: 31,660Success
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 08:3331,620164,922,308153,816,0001,124,0002,113,536
2Aug 3, 2026 08:3331,622165,046,249153,832,0001,119,0002,113,536
3Aug 3, 2026 08:3331,622165,016,575153,828,0001,124,0002,113,536
4Aug 3, 2026 08:3331,659165,923,700154,006,0001,124,0002,113,536
5Aug 3, 2026 08:3331,660165,974,342153,976,0001,159,0002,113,536
6Aug 3, 2026 08:3331,665165,505,460154,043,0001,117,0002,113,536
7Aug 3, 2026 08:3331,679165,274,438154,110,0001,121,0002,113,536
8Aug 3, 2026 08:3331,680166,736,383154,099,0001,135,0002,113,536
9Aug 3, 2026 08:3331,799165,884,326154,700,0001,119,0002,113,536