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:12M-RochatM-RochatScore: 121,036Success
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:12118,465592,329,806579,352,0001,131,0002,113,536
2May 18, 2026 01:12119,170593,373,892582,795,0001,138,0002,113,536
3May 18, 2026 01:12119,542597,857,769584,621,0001,139,0002,113,536
4May 18, 2026 01:12120,908601,824,543591,305,0001,147,0002,113,536
5May 18, 2026 01:12121,036604,576,836591,933,0001,146,0002,113,536
6May 18, 2026 01:12122,350608,939,472598,386,0001,133,0002,113,536
7May 18, 2026 01:12122,934613,940,140601,238,0001,140,0002,113,536
8May 18, 2026 01:12124,220618,554,226607,559,0001,119,0002,113,536
9May 18, 2026 01:12124,396620,467,436608,421,0001,122,0002,113,536