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:37M-RochatM-RochatScore: 110,869Success
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:38110,658553,336,230541,069,0001,157,0002,113,536
2May 18, 2026 01:38110,694554,583,232541,231,0001,171,0002,113,536
3May 18, 2026 01:38110,723553,377,769541,375,0001,170,0002,113,536
4May 18, 2026 01:38110,743552,594,401541,497,0001,144,0002,113,536
5May 18, 2026 01:38110,869554,949,729540,999,0002,262,0002,113,536
6May 18, 2026 01:38111,105553,892,424543,246,0001,171,0002,113,536
7May 18, 2026 01:38111,131554,906,121543,383,0001,159,0002,113,536
8May 18, 2026 01:38112,364561,103,708549,421,0001,163,0002,113,536
9May 18, 2026 01:38134,729670,423,698659,011,0001,165,0002,113,536