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 18:50Dominique GarmierDominique GarmierScore: 155,709Success
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 18:46154,970783,474,300759,352,00002,285,568
2Mar 21, 2026 18:46154,974788,387,869758,375,000999,0002,285,568
3Mar 21, 2026 18:30155,042787,645,799757,705,0001,999,0002,408,448
4Mar 21, 2026 18:50155,258782,933,483758,764,0001,999,0002,433,024
5Mar 21, 2026 18:30155,709789,164,601761,977,000999,0002,285,568
6Mar 21, 2026 18:50156,734791,451,419764,003,0003,994,0002,281,472
7Mar 21, 2026 18:30158,277801,692,020773,559,0001,998,0002,428,928
8Mar 21, 2026 18:46160,581815,538,318784,846,0001,999,0002,498,560
9Mar 21, 2026 18:50161,308817,431,017787,410,0002,997,0002,428,928