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:57M-RochatM-RochatScore: 110,627Success
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:57110,343553,017,201539,560,0001,122,0002,113,536
2May 20, 2026 15:57110,439550,959,403540,036,0001,119,0002,113,536
3May 20, 2026 15:57110,471553,787,478540,155,0001,154,0002,113,536
4May 20, 2026 15:57110,522554,020,318540,422,0001,140,0002,113,536
5May 20, 2026 15:57110,627551,584,699540,961,0001,115,0002,113,536
6May 20, 2026 15:57110,919555,642,168542,360,0001,145,0002,113,536
7May 20, 2026 15:57110,953556,048,239542,528,0001,145,0002,113,536
8May 20, 2026 15:57111,207555,886,999540,749,0004,170,0002,113,536
9May 20, 2026 15:57122,669612,181,482599,961,0001,120,0002,113,536