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:55anboto1anboto1Score: 118,812Success
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:56118,687591,560,566580,338,0001,233,0002,113,536
2Aug 2, 2026 11:56118,702591,806,078580,401,0001,239,0002,113,536
3Aug 2, 2026 11:56118,802592,296,230580,918,0001,216,0002,113,536
4Aug 2, 2026 11:56118,807592,241,022580,925,0001,233,0002,113,536
5Aug 2, 2026 11:56118,812592,233,857580,962,0001,221,0002,113,536
6Aug 2, 2026 11:56119,215594,333,608582,921,0001,233,0002,113,536
7Aug 2, 2026 11:56120,594600,984,203589,666,0001,249,0002,113,536
8Aug 2, 2026 11:56120,635601,418,618589,856,0001,260,0002,113,536
9Aug 2, 2026 11:56120,733601,565,932590,363,0001,230,0002,113,536