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:15M-RochatM-RochatScore: 121,395Success
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:16118,136591,040,865577,727,0001,144,0002,113,536
2May 18, 2026 01:16120,109599,974,183587,402,0001,135,0002,113,536
3May 18, 2026 01:16120,722601,972,573590,394,0001,144,0002,113,536
4May 18, 2026 01:16121,011602,960,291591,824,0001,131,0002,113,536
5May 18, 2026 01:16121,395604,808,478593,716,0001,124,0002,113,536
6May 18, 2026 01:16121,912610,154,571596,226,0001,145,0002,113,536
7May 18, 2026 01:16122,105608,148,617597,180,0001,138,0002,113,536
8May 18, 2026 01:16122,256610,688,490597,905,0001,151,0002,113,536
9May 18, 2026 01:16122,934611,885,130601,168,0001,209,0002,113,536