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:49anboto1anboto1Score: 58,052Success
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:5157,980293,232,752282,032,0002,073,0002,113,536
2Aug 3, 2026 20:5158,014292,817,531282,246,0002,025,0002,113,536
3Aug 3, 2026 20:5158,038293,479,751282,331,0002,059,0002,113,536
4Aug 3, 2026 20:5158,047293,518,380282,381,0002,050,0002,113,536
5Aug 3, 2026 20:5158,052293,520,448282,439,0002,020,0002,113,536
6Aug 3, 2026 20:5158,096293,788,548282,511,0002,161,0002,113,536
7Aug 3, 2026 20:5158,331294,341,901283,782,0002,044,0002,113,536
8Aug 3, 2026 20:5158,431295,401,151284,307,0002,006,0002,113,536
9Aug 3, 2026 20:5159,423299,657,302289,088,0002,088,0002,113,536