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 2, 2026 12:50Josu San MartinJosu San MartinScore: 33,125Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 12:5133,073172,007,178160,947,0001,115,0002,113,536
2Aug 2, 2026 12:5133,091172,973,074160,887,0001,262,0002,113,536
3Aug 2, 2026 12:5133,097172,959,168161,034,0001,144,0002,113,536
4Aug 2, 2026 12:5133,112172,315,598161,128,0001,122,0002,113,536
5Aug 2, 2026 12:5133,125172,394,258161,198,0001,117,0002,113,536
6Aug 2, 2026 12:5133,137172,394,958161,257,0001,116,0002,113,536
7Aug 2, 2026 12:5133,148172,579,426161,134,0001,294,0002,113,536
8Aug 2, 2026 12:5133,161172,497,450161,377,0001,114,0002,113,536
9Aug 2, 2026 12:5133,326174,151,480162,183,0001,119,0002,113,536