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:09M-RochatM-RochatScore: 122,209Success
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:10119,283594,024,263583,366,0001,122,0002,113,536
2May 18, 2026 01:10121,375604,424,588593,605,0001,134,0002,113,536
3May 18, 2026 01:10121,975608,828,092596,551,0001,130,0002,113,536
4May 18, 2026 01:10122,199608,126,528597,649,0001,127,0002,113,536
5May 18, 2026 01:10122,209610,492,988597,694,0001,134,0002,113,536
6May 18, 2026 01:10122,544610,492,280599,330,0001,137,0002,113,536
7May 18, 2026 01:10122,893613,257,178601,044,0001,136,0002,113,536
8May 18, 2026 01:10122,944611,892,802601,299,0001,129,0002,113,536
9May 18, 2026 01:10123,929617,477,202606,121,0001,135,0002,113,536