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:33anboto1anboto1Score: 57,625Success
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:3457,547290,420,406280,887,0001,098,0002,113,536
2Aug 3, 2026 21:3457,579290,608,810281,046,0001,093,0002,113,536
3Aug 3, 2026 21:3457,602290,701,830281,143,0001,110,0002,113,536
4Aug 3, 2026 21:3457,624290,913,024281,218,0001,142,0002,113,536
5Aug 3, 2026 21:3457,625290,792,625281,236,0001,127,0002,113,536
6Aug 3, 2026 21:3457,701291,191,424281,649,0001,087,0002,113,536
7Aug 3, 2026 21:3457,702291,226,728281,650,0001,090,0002,113,536
8Aug 3, 2026 21:3458,780296,467,556286,986,0001,038,0002,113,536
9Aug 3, 2026 21:3459,463299,952,715290,252,0001,117,0002,113,536