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 11:37Josu San MartinJosu San MartinScore: 31,425Success
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 11:3831,208163,721,644151,803,0001,121,0002,113,536
2Aug 2, 2026 11:3831,211163,854,351151,815,0001,120,0002,113,536
3Aug 2, 2026 11:3831,237163,855,216151,937,0001,127,0002,113,536
4Aug 2, 2026 11:3831,411164,505,208152,791,0001,125,0002,113,536
5Aug 2, 2026 11:3831,425163,955,750152,876,0001,111,0002,113,536
6Aug 2, 2026 11:3831,447164,129,701152,969,0001,124,0002,113,536
7Aug 2, 2026 11:3831,454164,083,871152,989,0001,137,0002,113,536
8Aug 2, 2026 11:3831,519164,537,134153,312,0001,133,0002,113,536
9Aug 2, 2026 11:3831,754165,711,226154,459,0001,138,0002,113,536