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:37anboto1anboto1Score: 57,711Success
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:3957,496290,688,556280,686,0001,045,0002,113,536
2Aug 3, 2026 20:3957,555291,120,377280,838,0001,182,0002,113,536
3Aug 3, 2026 20:3957,580290,564,265280,889,0001,253,0002,113,536
4Aug 3, 2026 20:3957,599290,606,026281,130,0001,109,0002,113,536
5Aug 3, 2026 20:3957,711291,368,854281,666,0001,122,0002,113,536
6Aug 3, 2026 20:3957,793292,245,005282,068,0001,120,0002,113,536
7Aug 3, 2026 20:3957,817293,113,362282,110,0001,197,0002,113,536
8Aug 3, 2026 20:3958,014293,365,911283,157,0001,114,0002,113,536
9Aug 3, 2026 20:3958,499295,109,938285,608,0001,039,0002,113,536