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 20:42anboto1anboto1Score: 57,646Success
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 20:4457,564290,482,720280,953,0001,111,0002,113,536
2Aug 3, 2026 20:4457,587291,189,841281,063,0001,118,0002,113,536
3Aug 3, 2026 20:4457,612291,372,505281,189,0001,110,0002,113,536
4Aug 3, 2026 20:4457,635291,550,519281,232,0001,183,0002,113,536
5Aug 3, 2026 20:4457,646291,499,179281,348,0001,118,0002,113,536
6Aug 3, 2026 20:4457,688291,143,268281,497,0001,175,0002,113,536
7Aug 3, 2026 20:4457,718291,891,446281,632,0001,189,0002,113,536
8Aug 3, 2026 20:4458,150294,027,146283,829,0001,106,0002,113,536
9Aug 3, 2026 20:4459,115298,821,771288,490,0001,177,0002,113,536