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 22:04anboto1anboto1Score: 58,177Success
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 22:0458,139294,107,863283,786,0001,099,0002,113,536
2Aug 3, 2026 22:0458,160294,138,287283,887,0001,099,0002,113,536
3Aug 3, 2026 22:0458,168293,492,693283,908,0001,116,0002,113,536
4Aug 3, 2026 22:0458,175294,182,529283,893,0001,165,0002,113,536
5Aug 3, 2026 22:0458,177294,207,561283,967,0001,102,0002,113,536
6Aug 3, 2026 22:0458,200294,211,125284,101,0001,083,0002,113,536
7Aug 3, 2026 22:0458,211294,232,246284,146,0001,090,0002,113,536
8Aug 3, 2026 22:0458,212293,756,543284,098,0001,142,0002,113,536
9Aug 3, 2026 22:0460,375304,918,497294,701,0001,137,0002,113,536