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 21:04anboto1anboto1Score: 57,774Success
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 21:0657,684291,064,528281,561,0001,091,0002,113,536
2Aug 3, 2026 21:0657,703291,307,943281,571,0001,178,0002,113,536
3Aug 3, 2026 21:0657,714291,113,724281,716,0001,083,0002,113,536
4Aug 3, 2026 21:0657,733291,331,662281,802,0001,091,0002,113,536
5Aug 3, 2026 21:0657,774292,126,066281,992,0001,105,0002,113,536
6Aug 3, 2026 21:0657,777293,839,186282,011,0001,101,0002,113,536
7Aug 3, 2026 21:0657,816291,746,717282,098,0001,201,0002,113,536
8Aug 3, 2026 21:0657,854292,625,421282,400,0001,087,0002,113,536
9Aug 3, 2026 21:0659,201298,758,866288,929,0001,160,0002,113,536