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:22anboto1anboto1Score: 58,490Success
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:2358,465295,497,792285,378,0001,103,0002,113,536
2Aug 3, 2026 20:2358,469295,507,445285,411,0001,090,0002,113,536
3Aug 3, 2026 20:2358,478295,014,056285,455,0001,089,0002,113,536
4Aug 3, 2026 20:2358,483295,606,941285,452,0001,118,0002,113,536
5Aug 3, 2026 20:2358,490295,015,523285,516,0001,087,0002,113,536
6Aug 3, 2026 20:2358,503295,662,731285,567,0001,098,0002,113,536
7Aug 3, 2026 20:2358,526295,216,317285,640,0001,142,0002,113,536
8Aug 3, 2026 20:2358,779297,050,010286,926,0001,092,0002,113,536
9Aug 3, 2026 20:2360,218309,037,336293,908,0001,163,0002,113,536