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 26, 2026 19:08Dominique GarmierDominique GarmierScore: 212,672Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 19:08212,6571,072,330,9221,039,023,0002,997,0002,523,136
2Mar 26, 2026 19:08212,6721,069,051,5161,039,097,0002,997,0002,285,568
3Mar 26, 2026 19:08212,7661,074,919,8801,039,555,0002,998,0002,519,040