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 31, 2026 21:48anboto1anboto1Score: 128,187Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 21:48126,720631,964,056619,555,0001,375,0002,113,536
2Jul 31, 2026 21:48127,010632,851,514620,985,0001,366,0002,113,536
3Jul 31, 2026 21:48127,179634,072,178621,818,0001,362,0002,113,536
4Jul 31, 2026 21:48127,527636,922,742623,523,0001,360,0002,113,536
5Jul 31, 2026 21:48128,187638,274,718626,762,0001,359,0002,113,536
6Jul 31, 2026 21:48128,537639,901,441628,481,0001,353,0002,113,536
7Jul 31, 2026 21:48128,685641,370,687629,195,0001,366,0002,113,536
8Jul 31, 2026 21:48129,817646,759,195634,732,0001,373,0002,113,536
9Jul 31, 2026 21:48130,069647,887,089635,978,0001,363,0002,113,536