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:14M-RochatM-RochatScore: 110,609Success
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:15110,438551,507,529539,997,0001,154,0002,113,536
2May 20, 2026 16:15110,479551,394,034540,193,0001,155,0002,113,536
3May 20, 2026 16:15110,499551,841,985540,326,0001,123,0002,113,536
4May 20, 2026 16:15110,536551,545,634540,493,0001,138,0002,113,536
5May 20, 2026 16:15110,609553,660,880540,853,0001,132,0002,113,536
6May 20, 2026 16:15110,639551,573,863541,009,0001,126,0002,113,536
7May 20, 2026 16:15110,791552,760,884541,727,0001,149,0002,113,536
8May 20, 2026 16:15113,208565,205,994553,582,0001,142,0002,113,536
9May 20, 2026 16:15114,113568,424,927558,042,0001,116,0002,113,536