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 23:39zielajzielajScore: 24,289Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2025 23:3924,253140,453,793116,843,0001,997,0002,326,528
2Jul 30, 2025 23:3924,254140,442,017116,849,0001,997,0002,473,984
3Jul 30, 2025 23:3924,282138,361,146116,985,0001,999,0002,338,816
4Jul 30, 2025 23:3924,286145,455,232118,001,0001,000,0002,326,528
5Jul 30, 2025 23:3924,289139,151,058118,017,0001,000,0002,461,696
6Jul 30, 2025 23:3924,291141,964,219117,026,0002,000,0002,338,816
7Jul 30, 2025 23:3924,291138,073,991117,027,0002,000,0002,338,816
8Jul 30, 2025 23:3924,293145,823,514116,036,0003,000,0002,469,888
9Jul 30, 2025 23:3924,293141,222,164117,036,0002,000,0002,301,952