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 23, 2025 00:13zielajzielajScore: 27,850Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 23, 2025 00:1327,832159,776,245136,379,00002,473,984
2Jul 23, 2025 00:1327,837161,951,563136,402,00002,330,624
3Jul 23, 2025 00:1327,842154,943,340136,427,00002,473,984
4Jul 23, 2025 00:1327,850169,351,340135,464,0001,003,0002,469,888
5Jul 23, 2025 00:1327,850160,197,937135,464,0001,003,0002,301,952
6Jul 23, 2025 00:1327,852160,607,309136,476,00002,469,888
7Jul 23, 2025 00:1327,860167,345,587136,514,00002,342,912
8Jul 23, 2025 00:1327,869162,466,087135,554,0001,004,0002,322,432
9Jul 23, 2025 00:1327,893165,051,415134,682,0001,995,0002,322,432