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 listNov 11, 2025 01:10izotoffizotoffScore: 710,808Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2025 01:10703,9363,472,900,9973,448,289,000999,0002,326,528
2Nov 11, 2025 01:10704,4733,478,583,0893,450,921,000999,0002,322,432
3Nov 11, 2025 01:10704,4823,479,953,6313,447,963,0003,997,0002,326,528
4Nov 11, 2025 01:10710,7953,509,489,0673,476,899,0005,996,0002,326,528
5Nov 11, 2025 01:10710,8083,511,631,8803,480,962,0001,998,0002,322,432
6Nov 11, 2025 01:10710,8503,513,403,6753,479,169,0003,997,0002,326,528
7Nov 11, 2025 01:10710,9373,512,989,6343,482,590,000999,0002,326,528
8Nov 11, 2025 01:10711,0713,511,320,7343,482,251,0001,998,0002,326,528
9Nov 11, 2025 01:10734,4333,631,990,8293,595,723,0002,998,0002,326,528