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 21, 2026 01:14Dominique GarmierDominique GarmierScore: 1,251,092Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 01:141,250,1506,153,225,7576,122,735,0002,998,0002,330,624
2Mar 20, 2026 18:541,250,7236,154,051,6486,125,545,0002,998,0002,326,528
3Mar 20, 2026 21:111,250,7976,158,549,0086,126,907,0001,998,0002,322,432
4Mar 20, 2026 18:541,251,0076,158,350,3636,126,937,0002,998,0002,326,528
5Mar 20, 2026 21:111,251,0926,157,812,0286,128,353,0001,999,0002,330,624
6Mar 20, 2026 18:541,251,1976,165,067,9906,128,867,0001,998,0002,326,528
7Mar 21, 2026 01:141,251,3256,162,031,6846,128,496,0002,998,0002,330,624
8Mar 21, 2026 01:141,252,0546,160,914,6056,129,069,0005,997,0002,330,624
9Mar 20, 2026 21:111,257,0316,200,639,2266,154,456,0004,995,0002,330,624