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:55anboto1anboto1Score: 57,635Success
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:5857,517290,289,283280,812,0001,024,0002,113,536
2Aug 3, 2026 20:5857,547291,001,267280,892,0001,091,0002,113,536
3Aug 3, 2026 20:5857,591291,358,056280,926,0001,273,0002,113,536
4Aug 3, 2026 20:5857,613291,420,174281,222,0001,085,0002,113,536
5Aug 3, 2026 20:5857,635291,427,661281,320,0001,096,0002,113,536
6Aug 3, 2026 20:5857,645290,972,722281,349,0001,112,0002,113,536
7Aug 3, 2026 20:5857,954293,065,496282,884,0001,091,0002,113,536
8Aug 3, 2026 20:5859,073298,008,791288,327,0001,132,0002,113,536
9Aug 3, 2026 20:5859,157298,883,623288,754,0001,120,0002,113,536