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 listAug 3, 2026 03:16Josu San MartinJosu San MartinScore: 29,034Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 03:1629,024150,734,939140,956,0001,263,0002,113,536
2Aug 3, 2026 03:1629,028150,654,828141,232,0001,006,0002,113,536
3Aug 3, 2026 03:1629,031150,730,012141,243,0001,011,0002,113,536
4Aug 3, 2026 03:1629,032151,299,729141,004,0001,256,0002,113,536
5Aug 3, 2026 03:1629,034150,708,638141,005,0001,265,0002,113,536
6Aug 3, 2026 03:1629,062150,809,304141,399,0001,007,0002,113,536
7Aug 3, 2026 03:1629,088151,579,497141,260,0001,272,0002,113,536
8Aug 3, 2026 03:1629,439152,738,707143,245,0001,008,0002,113,536
9Aug 3, 2026 03:1629,551152,952,479143,791,0001,009,0002,113,536