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 22, 2026 20:34M-RochatM-RochatScore: 110,959Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 20:35110,629551,616,567540,929,0001,157,0002,113,536
2May 22, 2026 20:35110,632553,441,632540,964,0001,134,0002,113,536
3May 22, 2026 20:35110,712553,733,158541,329,0001,162,0002,113,536
4May 22, 2026 20:35110,922555,922,576542,389,0001,133,0002,113,536
5May 22, 2026 20:35110,959555,200,211542,581,0001,119,0002,113,536
6May 22, 2026 20:35110,978557,332,445542,644,0001,152,0002,113,536
7May 22, 2026 20:35113,782567,520,136556,377,0001,155,0002,113,536
8May 22, 2026 20:35113,903569,860,370556,973,0001,156,0002,113,536
9May 22, 2026 20:35153,737764,305,831752,187,0001,129,0002,113,536