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:34M-RochatM-RochatScore: 113,862Success
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:35110,630552,065,596539,862,0002,229,0002,113,536
2May 18, 2026 01:35110,983553,480,776542,663,0001,154,0002,113,536
3May 18, 2026 01:35111,004555,425,139542,787,0001,136,0002,113,536
4May 18, 2026 01:35111,139554,994,708543,424,0001,159,0002,113,536
5May 18, 2026 01:35113,862567,912,785556,748,0001,178,0002,113,536
6May 18, 2026 01:35114,491570,870,213559,842,0001,164,0002,113,536
7May 18, 2026 01:35114,778583,783,408561,200,0001,217,0002,113,536
8May 18, 2026 01:35120,842602,384,242590,980,0001,149,0002,113,536
9May 18, 2026 01:35129,404643,549,074632,904,0001,178,0002,113,536