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 15:32M-RochatM-RochatScore: 111,935Success
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 15:34110,574555,030,832540,700,0001,114,0002,113,536
2May 20, 2026 15:34110,592553,296,326540,812,0001,090,0002,113,536
3May 20, 2026 15:34110,593551,310,794540,830,0001,079,0002,113,536
4May 20, 2026 15:34110,609552,948,831540,890,0001,095,0002,113,536
5May 20, 2026 15:34111,935560,604,655547,382,0001,102,0002,113,536
6May 20, 2026 15:34111,956559,820,568547,501,0001,086,0002,113,536
7May 20, 2026 15:34112,821563,280,592551,734,0001,092,0002,113,536
8May 20, 2026 15:34113,343566,973,054554,291,0001,091,0002,113,536
9May 20, 2026 15:34116,374582,210,198569,129,0001,107,0002,113,536