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:39M-RochatM-RochatScore: 113,238Success
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:41110,752552,115,657541,539,0001,146,0002,113,536
2May 18, 2026 01:41111,135553,972,990543,424,0001,142,0002,113,536
3May 18, 2026 01:41111,202554,922,693543,744,0001,149,0002,113,536
4May 18, 2026 01:41111,205556,096,879543,763,0001,142,0002,113,536
5May 18, 2026 01:41113,238564,838,747553,703,0001,164,0002,113,536
6May 18, 2026 01:41114,440570,131,686559,627,0001,129,0002,113,536
7May 18, 2026 01:41114,492571,694,812559,808,0001,206,0002,113,536
8May 18, 2026 01:41114,570573,631,117560,222,0001,174,0002,113,536
9May 18, 2026 01:41115,948577,451,452566,986,0001,164,0002,113,536