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:52wnwnScore: 104,583Success
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:53104,572523,078,835510,377,0002,027,0002,113,536
2May 11, 2026 10:53104,574521,146,742510,367,0002,047,0002,113,536
3May 11, 2026 10:53104,576521,492,681510,373,0002,054,0002,113,536
4May 11, 2026 10:53104,579522,996,801510,366,0002,072,0002,113,536
5May 11, 2026 10:53104,583524,175,379510,449,0002,008,0002,113,536
6May 11, 2026 10:53104,638522,009,156510,629,0002,100,0002,113,536
7May 11, 2026 10:53104,754522,098,161511,289,0002,010,0002,113,536
8May 11, 2026 10:53104,782524,210,389511,389,0002,046,0002,113,536
9May 11, 2026 10:53105,002524,465,679512,462,0002,048,0002,113,536