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:00A_ShamanA_ShamanScore: 204,961Success
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:00203,3761,005,569,609995,544,0001,002,0002,113,536
2Jun 21, 2026 17:00204,3411,010,417,017999,253,0002,019,0002,113,536
3Jun 21, 2026 17:00204,4701,011,145,3081,000,901,0001,003,0002,113,536
4Jun 21, 2026 17:00204,9281,013,202,8401,003,146,0001,002,0002,113,536
5Jun 21, 2026 17:00204,9611,013,484,2561,003,311,0001,002,0002,113,536
6Jun 21, 2026 17:00207,6111,026,417,8091,016,294,0001,002,0002,113,536
7Jun 21, 2026 17:00208,5241,030,917,1711,020,770,0001,002,0002,113,536
8Jun 21, 2026 17:00209,2271,034,405,5451,024,216,0001,001,0002,113,536
9Jun 21, 2026 17:00209,2381,034,331,8111,024,266,0001,001,0002,113,536