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:15M-RochatM-RochatScore: 122,545Success
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:17119,125595,298,481582,575,0001,142,0002,113,536
2May 18, 2026 01:17119,821596,480,427585,993,0001,131,0002,113,536
3May 18, 2026 01:17120,892603,654,727591,226,0001,145,0002,113,536
4May 18, 2026 01:17122,388609,149,943598,563,0001,141,0002,113,536
5May 18, 2026 01:17122,545610,221,640599,324,0001,149,0002,113,536
6May 18, 2026 01:17122,749613,796,059600,341,0001,132,0002,113,536
7May 18, 2026 01:17123,173615,903,382602,400,0001,149,0002,113,536
8May 18, 2026 01:17124,418619,625,171608,511,0001,140,0002,113,536
9May 18, 2026 01:17126,626632,104,654619,330,0001,141,0002,113,536