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:24anboto1anboto1Score: 57,463Success
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:2457,193289,296,993279,127,0001,121,0002,113,536
2Aug 3, 2026 22:2457,208288,824,284279,236,0001,087,0002,113,536
3Aug 3, 2026 22:2457,215289,450,158279,279,0001,078,0002,113,536
4Aug 3, 2026 22:2457,432290,511,081280,326,0001,091,0002,113,536
5Aug 3, 2026 22:2457,463290,607,528280,383,0001,189,0002,113,536
6Aug 3, 2026 22:2457,464290,685,535280,348,0001,228,0002,113,536
7Aug 3, 2026 22:2457,470290,736,775280,441,0001,165,0002,113,536
8Aug 3, 2026 22:2457,484290,697,407280,572,0001,104,0002,113,536
9Aug 3, 2026 22:2457,647290,948,558281,377,0001,097,0002,113,536