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:10wnwnScore: 132,431Success
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:11131,030651,239,629639,854,0002,193,0002,113,536
2May 11, 2026 10:11131,048653,232,841640,072,0002,065,0002,113,536
3May 11, 2026 10:11131,503655,978,454642,251,0002,115,0002,113,536
4May 11, 2026 10:11132,396658,377,318646,697,0002,044,0002,113,536
5May 11, 2026 10:11132,431659,019,863646,809,0002,106,0002,113,536
6May 11, 2026 10:11132,448657,766,111646,932,0002,067,0002,113,536
7May 11, 2026 10:11132,456657,884,410646,992,0002,047,0002,113,536
8May 11, 2026 10:11135,756674,934,605663,013,0002,194,0002,113,536
9May 11, 2026 10:11135,788675,856,301663,240,0002,122,0002,113,536