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 listMay 20, 2026 16:03M-RochatM-RochatScore: 110,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 16:04110,417550,410,500539,908,0001,136,0002,113,536
2May 20, 2026 16:04110,418550,647,384539,905,0001,146,0002,113,536
3May 20, 2026 16:04110,444551,697,747540,061,0001,115,0002,113,536
4May 20, 2026 16:04110,546553,246,781540,551,0001,127,0002,113,536
5May 20, 2026 16:04110,970555,408,187542,618,0001,139,0002,113,536
6May 20, 2026 16:04111,226556,470,406541,835,0003,174,0002,113,536
7May 20, 2026 16:04112,154561,542,802548,414,0001,145,0002,113,536
8May 20, 2026 16:04113,742566,946,282556,203,0001,134,0002,113,536
9May 20, 2026 16:04114,291570,438,079558,901,0001,128,0002,113,536