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 09:01M-RochatM-RochatScore: 110,722Success
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 09:02110,539551,111,801540,519,0001,123,0002,113,536
2May 18, 2026 09:02110,597551,499,837540,798,0001,131,0002,113,536
3May 18, 2026 09:02110,622552,532,537540,911,0001,140,0002,113,536
4May 18, 2026 09:02110,673553,970,434541,119,0001,180,0002,113,536
5May 18, 2026 09:02110,722553,089,354541,393,0001,149,0002,113,536
6May 18, 2026 09:02111,162555,931,451543,519,0001,179,0002,113,536
7May 18, 2026 09:02114,111569,098,388557,994,0001,153,0002,113,536
8May 18, 2026 09:02114,267569,644,283558,747,0001,163,0002,113,536
9May 18, 2026 09:02152,045757,475,817743,894,0001,129,0002,113,536