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:26M-RochatM-RochatScore: 113,425Success
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:27111,951560,707,147547,427,0001,134,0002,113,536
2May 18, 2026 01:27112,071559,431,887548,003,0001,145,0002,113,536
3May 18, 2026 01:27112,136559,005,723548,330,0001,137,0002,113,536
4May 18, 2026 01:27113,262565,985,792553,857,0001,131,0002,113,536
5May 18, 2026 01:27113,425569,183,286554,657,0001,127,0002,113,536
6May 18, 2026 01:27113,564565,934,322555,310,0001,156,0002,113,536
7May 18, 2026 01:27116,156580,293,690568,028,0001,137,0002,113,536
8May 18, 2026 01:27116,177579,067,844568,132,0001,138,0002,113,536
9May 18, 2026 01:27116,367580,988,771569,064,0001,139,0002,113,536