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:21M-RochatM-RochatScore: 113,284Success
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:21111,835558,748,467546,861,0001,135,0002,113,536
2May 18, 2026 01:21111,868558,344,888547,035,0001,119,0002,113,536
3May 18, 2026 01:21111,979560,166,854547,572,0001,129,0002,113,536
4May 18, 2026 01:21113,198564,926,890553,543,0001,132,0002,113,536
5May 18, 2026 01:21113,284567,355,215553,951,0001,141,0002,113,536
6May 18, 2026 01:21113,374567,722,696554,396,0001,139,0002,113,536
7May 18, 2026 01:21113,406566,925,031554,555,0001,136,0002,113,536
8May 18, 2026 01:21113,406567,698,226554,548,0001,143,0002,113,536
9May 18, 2026 01:21113,422568,110,043554,603,0001,165,0002,113,536