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 1, 2026 12:01Josu San MartinJosu San MartinScore: 35,655Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 12:0235,649184,717,282173,557,0001,125,0002,113,536
2Aug 1, 2026 12:0235,652184,853,085173,593,0001,104,0002,113,536
3Aug 1, 2026 12:0235,653184,817,732173,575,0001,129,0002,113,536
4Aug 1, 2026 12:0235,654185,670,679173,591,0001,117,0002,113,536
5Aug 1, 2026 12:0235,655185,522,089173,593,0001,121,0002,113,536
6Aug 1, 2026 12:0235,662184,911,072173,634,0001,113,0002,113,536
7Aug 1, 2026 12:0235,664185,554,652173,611,0001,143,0002,113,536
8Aug 1, 2026 12:0235,674185,833,707173,678,0001,127,0002,113,536
9Aug 1, 2026 12:0235,678184,936,442173,709,0001,115,0002,113,536