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 listJul 30, 2025 01:45zielajzielajScore: 24,292Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2025 20:3024,279143,422,602117,967,000999,0002,473,984
2Jul 29, 2025 20:3024,282143,954,943115,984,0002,999,0002,334,720
3Jul 29, 2025 20:3024,286142,304,672118,003,0001,000,0002,330,624
4Jul 29, 2025 20:3024,290138,441,794118,019,0001,000,0002,482,176
5Jul 29, 2025 20:3024,291146,446,277118,028,0001,000,0002,469,888
6Jul 30, 2025 01:4524,291147,199,232118,027,0001,000,0002,457,600
7Jul 29, 2025 20:3024,292141,490,928117,031,0002,000,0002,334,720
8Jul 30, 2025 01:4524,293148,274,547118,038,0001,000,0002,465,792
9Jul 29, 2025 20:3024,294142,917,817117,042,0002,000,0002,322,432
10Jul 29, 2025 20:3024,300142,664,766117,068,0002,001,0002,457,600
11Jul 30, 2025 01:4524,306143,524,475117,097,0002,001,0002,301,952
12Jul 29, 2025 20:3026,154154,280,759126,154,0002,002,0002,334,720