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 18:50Josu San MartinJosu San MartinScore: 34,232Success
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 18:5134,178177,614,077166,366,0001,111,0002,113,536
2Aug 2, 2026 18:5134,217177,715,845166,544,0001,120,0002,113,536
3Aug 2, 2026 18:5134,226178,505,737166,585,0001,126,0002,113,536
4Aug 2, 2026 18:5134,228178,611,723166,581,0001,137,0002,113,536
5Aug 2, 2026 18:5134,232178,423,271166,611,0001,129,0002,113,536
6Aug 2, 2026 18:5134,239179,880,776166,633,0001,139,0002,113,536
7Aug 2, 2026 18:5134,273178,020,246166,832,0001,110,0002,113,536
8Aug 2, 2026 18:5134,297178,235,349166,943,0001,113,0002,113,536
9Aug 2, 2026 18:5134,306178,950,410166,966,0001,136,0002,113,536