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 07:23wnwnScore: 112,005Success
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 07:24111,070553,032,487541,129,0003,115,0002,113,536
2May 11, 2026 07:24111,146553,427,167541,459,0003,158,0002,113,536
3May 11, 2026 07:24111,204554,405,593541,756,0003,144,0002,113,536
4May 11, 2026 07:24111,210555,017,791541,788,0003,144,0002,113,536
5May 11, 2026 07:24112,005558,434,578545,820,0003,009,0002,113,536
6May 11, 2026 07:24112,103560,073,489546,052,0003,256,0002,113,536
7May 11, 2026 07:24112,183567,082,303546,692,0003,009,0002,113,536
8May 11, 2026 07:24112,195571,977,710546,660,0003,099,0002,113,536
9May 11, 2026 07:24112,459574,058,282548,043,0003,010,0002,113,536