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 18, 2026 01:31M-RochatM-RochatScore: 111,133Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 01:31110,552553,725,021540,525,0001,180,0002,113,536
2May 18, 2026 01:31110,586552,392,175540,722,0001,150,0002,113,536
3May 18, 2026 01:31110,697553,396,109541,288,0001,130,0002,113,536
4May 18, 2026 01:31110,716553,552,128541,367,0001,144,0002,113,536
5May 18, 2026 01:31111,133555,338,075543,422,0001,131,0002,113,536
6May 18, 2026 01:31114,113569,646,175558,016,0001,139,0002,113,536
7May 18, 2026 01:31131,128655,640,788641,372,0001,156,0002,113,536
8May 18, 2026 01:31140,447698,097,623687,037,0001,158,0002,113,536
9May 18, 2026 01:31152,812758,516,645747,630,0001,150,0002,113,536