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 listMay 11, 2025 10:16Emanuele BolognesiEmanuele BolognesiScore: 944,146Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2025 10:16943,4314,648,198,5764,621,811,000999,0002,281,472
2May 11, 2025 10:16943,9864,656,885,0084,624,533,000999,0002,281,472
3May 11, 2025 10:16944,0424,657,896,6244,624,805,000999,0002,285,568
4May 11, 2025 10:16944,0974,654,548,3024,626,077,00002,281,472
5May 11, 2025 10:16944,1464,656,309,3744,624,315,0001,998,0002,281,472
6May 11, 2025 10:16944,2164,662,117,3824,624,662,0001,998,0002,285,568
7May 11, 2025 10:16944,4184,659,047,0004,625,650,0001,998,0002,285,568
8May 11, 2025 10:16944,5504,661,708,7974,626,296,0001,998,0002,285,568
9May 11, 2025 10:16944,7164,660,391,3214,627,110,0001,998,0002,285,568