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 listJun 12, 2025 19:06Daniel NeumannDaniel NeumannScore: 1,611,951Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2025 19:061,609,7267,917,766,0897,885,657,0001,998,0002,285,568
2Jun 12, 2025 19:061,611,9517,927,493,7817,897,560,000999,0002,285,568
3Jun 12, 2025 19:061,756,7088,638,553,5158,605,871,0001,999,0002,281,472