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 13, 2025 00:56zielajzielajScore: 42,026Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2025 00:5641,768227,887,969202,665,0001,996,0002,318,336
2Jul 13, 2025 00:5641,772227,368,358203,686,000998,0002,445,312
3Jul 13, 2025 00:5641,833225,863,831203,982,000999,0002,453,504
4Jul 13, 2025 00:5641,835224,690,932203,991,000999,0002,445,312
5Jul 13, 2025 00:5642,026230,162,129204,929,000999,0002,461,696
6Jul 13, 2025 00:5642,030231,378,009204,947,000999,0002,322,432
7Jul 13, 2025 00:5642,072240,301,020205,151,0001,000,0002,326,528
8Jul 13, 2025 00:5642,076230,546,828206,172,00002,310,144
9Jul 13, 2025 00:5642,085228,213,880206,217,00002,453,504