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 28, 2026 19:02Dominique GarmierDominique GarmierScore: 209,670Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 19:02209,6091,054,660,7971,023,087,0003,996,0002,285,568
2Mar 28, 2026 19:02209,6701,054,568,0411,023,384,0003,997,0002,285,568
3Mar 28, 2026 19:02209,9371,056,127,6501,025,693,0002,999,0002,281,472