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:13anboto1anboto1Score: 57,726Success
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:1457,613291,318,642281,160,0001,148,0002,113,536
2Aug 3, 2026 21:1457,615292,748,669281,214,0001,103,0002,113,536
3Aug 3, 2026 21:1457,656291,634,151281,350,0001,166,0002,113,536
4Aug 3, 2026 21:1457,668291,687,916281,385,0001,193,0002,113,536
5Aug 3, 2026 21:1457,726291,882,424281,698,0001,163,0002,113,536
6Aug 3, 2026 21:1457,754292,065,842281,885,0001,114,0002,113,536
7Aug 3, 2026 21:1457,830291,816,771282,278,0001,092,0002,113,536
8Aug 3, 2026 21:1458,070293,677,666283,371,0001,174,0002,113,536
9Aug 3, 2026 21:1459,199299,196,125288,877,0001,202,0002,113,536