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 22, 2026 14:43Dominique GarmierDominique GarmierScore: 253,563Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 14:43253,0071,268,529,9181,236,739,0002,996,0002,285,568
2Mar 22, 2026 14:43253,5631,269,434,3411,238,460,0003,998,0002,289,664
3Mar 22, 2026 14:43253,9141,271,865,9791,241,179,0002,998,0002,273,280