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 11, 2026 10:26wnwnScore: 99,208Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 10:2798,653492,466,862481,329,0002,072,0002,113,536
2May 11, 2026 10:2798,682492,285,532481,519,0002,025,0002,113,536
3May 11, 2026 10:2798,776494,667,942481,965,0002,041,0002,113,536
4May 11, 2026 10:2799,192496,670,873485,039,0001,005,0002,113,536
5May 11, 2026 10:2799,208495,345,038484,099,0002,025,0002,113,536
6May 11, 2026 10:2799,211496,007,975484,104,0002,034,0002,113,536
7May 11, 2026 10:2799,216494,900,791484,111,0002,050,0002,113,536
8May 11, 2026 10:2799,228494,981,690484,214,0002,006,0002,113,536
9May 11, 2026 10:2799,244496,050,132484,230,0002,067,0002,113,536