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 15:47M-RochatM-RochatScore: 110,963Success
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 15:49110,618552,433,895540,898,0001,134,0002,113,536
2May 20, 2026 15:49110,659553,346,108541,094,0001,136,0002,113,536
3May 20, 2026 15:49110,734552,659,667541,451,0001,146,0002,113,536
4May 20, 2026 15:49110,935554,796,254542,442,0001,141,0002,113,536
5May 20, 2026 15:49110,963555,025,580542,583,0001,138,0002,113,536
6May 20, 2026 15:49112,276561,823,066549,013,0001,140,0002,113,536
7May 20, 2026 15:49114,287569,499,025558,880,0001,129,0002,113,536
8May 20, 2026 15:49114,296572,143,576558,930,0001,122,0002,113,536
9May 20, 2026 15:49114,300571,266,217558,942,0001,131,0002,113,536