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 15, 2025 01:33zielajzielajScore: 40,340Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2025 01:3340,307229,534,092197,503,00002,310,144
2Jul 15, 2025 01:3340,322220,272,835195,581,0001,995,0002,441,216
3Jul 15, 2025 01:3340,326220,359,734196,599,000997,0002,301,952
4Jul 15, 2025 01:3340,331223,566,755195,626,0001,996,0002,289,664
5Jul 15, 2025 01:3340,340227,761,471194,674,0002,994,0002,301,952
6Jul 15, 2025 01:3340,374222,572,416196,836,000999,0002,310,144
7Jul 15, 2025 01:3340,386217,174,882196,894,000999,0002,433,024
8Jul 15, 2025 01:3340,405223,559,300194,987,0002,999,0002,314,240
9Jul 15, 2025 01:3340,409220,797,165197,004,0001,000,0002,318,336