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 21, 2026 17:12A_ShamanA_ShamanScore: 193,692Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 17:13193,640957,996,954946,713,0002,126,0002,113,536
2Jun 21, 2026 17:13193,660958,127,377946,893,0002,045,0002,113,536
3Jun 21, 2026 17:13193,664958,287,639946,714,0002,240,0002,113,536
4Jun 21, 2026 17:13193,670958,156,909946,965,0002,021,0002,113,536
5Jun 21, 2026 17:13193,692958,123,676946,973,0002,121,0002,113,536
6Jun 21, 2026 17:13193,700958,369,319946,913,0002,218,0002,113,536
7Jun 21, 2026 17:13194,424961,908,290950,638,0002,043,0002,113,536
8Jun 21, 2026 17:13194,468962,040,063950,850,0002,046,0002,113,536
9Jun 21, 2026 17:13194,537962,430,287951,139,0002,093,0002,113,536