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 1, 2026 12:35Josu San MartinJosu San MartinScore: 34,197Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 12:3634,172177,870,874166,324,0001,122,0002,113,536
2Aug 1, 2026 12:3634,182179,116,804166,371,0001,125,0002,113,536
3Aug 1, 2026 12:3634,190177,544,210166,420,0001,113,0002,117,632
4Aug 1, 2026 12:3634,193178,414,445166,431,0001,118,0002,113,536
5Aug 1, 2026 12:3634,197177,669,485166,445,0001,121,0002,113,536
6Aug 1, 2026 12:3634,198178,493,834166,442,0001,129,0002,113,536
7Aug 1, 2026 12:3634,214178,481,348166,524,0001,126,0002,113,536
8Aug 1, 2026 12:3634,217178,457,744166,531,0001,133,0002,113,536
9Aug 1, 2026 12:3635,398183,864,355172,331,0001,122,0002,113,536