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 3, 2026 22:22anboto1anboto1Score: 57,405Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 22:2257,198289,356,080279,181,0001,093,0002,113,536
2Aug 3, 2026 22:2257,205289,403,012279,221,0001,085,0002,113,536
3Aug 3, 2026 22:2257,221289,492,825279,144,0001,242,0002,113,536
4Aug 3, 2026 22:2257,331289,348,041279,736,0001,188,0002,113,536
5Aug 3, 2026 22:2257,405290,506,492280,190,0001,095,0002,113,536
6Aug 3, 2026 22:2257,417289,796,528280,228,0001,119,0002,113,536
7Aug 3, 2026 22:2257,459290,029,032280,528,0001,022,0002,113,536
8Aug 3, 2026 22:2257,947293,486,621282,839,0001,102,0002,113,536
9Aug 3, 2026 22:2257,971293,157,948282,882,0001,177,0002,113,536