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 listMar 23, 2026 04:46Dominique GarmierDominique GarmierScore: 319,122Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 04:01318,8841,587,630,8431,561,532,000999,0002,396,160
2Mar 23, 2026 04:46318,8981,596,165,0221,561,599,000999,0002,273,280
3Mar 23, 2026 04:01318,9041,594,164,0221,560,633,0001,998,0002,281,472
4Mar 23, 2026 04:46319,1221,589,311,6151,560,702,0002,997,0002,392,064
5Mar 23, 2026 04:01319,1511,589,318,4441,561,840,0001,998,0002,273,280
6Mar 23, 2026 04:46319,2531,596,227,3651,562,342,0001,997,0002,281,472