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 listMar 30, 2026 02:59Dominique GarmierDominique GarmierScore: 126,841Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 02:59126,452647,165,355617,615,0001,998,0002,289,664
2Mar 30, 2026 02:59126,467646,243,259618,690,000999,0002,289,664
3Mar 30, 2026 02:59126,507647,488,222618,886,000999,0002,289,664
4Mar 30, 2026 02:59126,510643,282,443618,899,000999,0002,445,312
5Mar 30, 2026 02:59126,841647,470,842618,526,0002,997,0002,289,664
6Mar 30, 2026 02:59126,855651,648,497620,590,000999,0002,289,664
7Mar 30, 2026 02:59126,968644,385,026621,141,0001,000,0002,289,664
8Mar 30, 2026 02:59127,032649,825,279621,457,000999,0002,338,816
9Mar 30, 2026 02:59129,682662,417,432633,444,0001,998,0002,285,568