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 12:11Josu San MartinJosu San MartinScore: 34,216Success
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 12:1234,198178,282,808166,444,0001,131,0002,113,536
2Aug 2, 2026 12:1234,199178,296,666166,425,0001,151,0002,113,536
3Aug 2, 2026 12:1234,205178,405,567166,477,0001,128,0002,113,536
4Aug 2, 2026 12:1234,209177,820,492166,501,0001,125,0002,113,536
5Aug 2, 2026 12:1234,216178,477,846166,531,0001,132,0002,113,536
6Aug 2, 2026 12:1234,223177,656,263166,579,0001,116,0002,113,536
7Aug 2, 2026 12:1234,234177,695,446166,643,0001,107,0002,113,536
8Aug 2, 2026 12:1234,545180,046,154168,155,0001,120,0002,113,536
9Aug 2, 2026 12:1234,572179,470,868168,291,0001,113,0002,113,536