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 29, 2026 03:07Josu San MartinJosu San MartinScore: 24,214Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 03:0724,200126,968,595117,317,0001,263,0002,113,536
2Aug 29, 2026 03:0724,208127,747,014117,345,0001,278,0002,113,536
3Aug 29, 2026 03:0724,211127,031,205117,379,0001,259,0002,113,536
4Aug 29, 2026 03:0724,212127,108,926117,376,0001,263,0002,113,536
5Aug 29, 2026 03:0724,214127,101,479117,396,0001,255,0002,113,536
6Aug 29, 2026 03:0724,214127,065,109117,399,0001,252,0002,113,536
7Aug 29, 2026 03:0724,245127,208,696117,695,0001,108,0002,113,536
8Aug 29, 2026 03:0724,950131,296,820121,250,0001,007,0002,113,536
9Aug 29, 2026 03:0725,318133,670,870123,046,0001,017,0002,113,536