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 listAug 3, 2026 20:17anboto1anboto1Score: 63,093Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 20:1862,888318,410,363307,118,0001,037,0002,113,536
2Aug 3, 2026 20:1862,923316,765,010307,177,0001,148,0002,113,536
3Aug 3, 2026 20:1862,951317,585,454307,368,0001,094,0002,113,536
4Aug 3, 2026 20:1862,984317,073,995307,520,0001,104,0002,113,536
5Aug 3, 2026 20:1863,093317,669,147307,962,0001,195,0002,113,536
6Aug 3, 2026 20:1863,152321,682,936308,351,0001,097,0002,113,536
7Aug 3, 2026 20:1863,288319,305,951308,927,0001,187,0002,113,536
8Aug 3, 2026 20:1864,076322,969,115312,886,0001,087,0002,113,536
9Aug 3, 2026 20:1865,728332,317,015320,858,0001,212,0002,113,536