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:42anboto1anboto1Score: 57,593Success
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:4357,526290,688,789280,773,0001,107,0002,113,536
2Aug 3, 2026 21:4357,538291,030,418280,847,0001,094,0002,113,536
3Aug 3, 2026 21:4357,581290,658,429281,096,0001,053,0002,113,536
4Aug 3, 2026 21:4357,589291,424,186281,030,0001,160,0002,113,536
5Aug 3, 2026 21:4357,593291,294,424281,109,0001,099,0002,113,536
6Aug 3, 2026 21:4357,628291,399,498281,288,0001,094,0002,113,536
7Aug 3, 2026 21:4357,710291,338,595281,620,0001,159,0002,113,536
8Aug 3, 2026 21:4357,907292,223,566282,654,0001,095,0002,113,536
9Aug 3, 2026 21:4358,224294,468,956284,205,0001,093,0002,113,536