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 18, 2025 00:11zielajzielajScore: 33,137Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2025 20:5833,083187,592,213160,108,0002,001,0002,306,048
2Jul 17, 2025 20:5833,089182,634,596162,134,00002,453,504
3Jul 18, 2025 00:1833,097191,219,087161,176,0001,001,0002,318,336
4Jul 17, 2025 20:5833,109187,644,133161,233,0001,001,0002,306,048
5Jul 17, 2025 20:5833,111193,795,682162,244,00002,314,240
6Jul 17, 2025 20:5833,125180,042,216162,313,00002,453,504
7Jul 17, 2025 20:5833,136185,149,209162,367,00002,293,760
8Jul 17, 2025 20:5833,137181,339,264162,372,00002,289,664
9Jul 17, 2025 20:5833,475187,948,521163,026,0001,000,0002,318,336
10Jul 18, 2025 00:1833,914191,578,009166,181,00002,322,432
11Jul 18, 2025 00:1134,216195,157,570167,660,00002,301,952
12Jul 18, 2025 00:1135,366194,803,286171,292,0002,003,0002,326,528
13Jul 17, 2025 20:5836,026201,933,129175,525,0001,003,0002,293,760
14Jul 18, 2025 00:1136,352197,405,444176,126,0002,001,0002,453,504
15Jul 18, 2025 00:1853,339278,371,594261,360,00002,318,336