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 4, 2026 07:43Josu San MartinJosu San MartinScore: 26,160Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 07:4326,121137,046,547126,964,0001,033,0002,113,536
2Aug 4, 2026 07:4326,125137,081,481126,758,0001,257,0002,113,536
3Aug 4, 2026 07:4326,127136,445,557126,771,0001,253,0002,113,536
4Aug 4, 2026 07:4326,136136,466,242126,807,0001,262,0002,113,536
5Aug 4, 2026 07:4326,160136,597,914127,166,0001,019,0002,113,536
6Aug 4, 2026 07:4326,181138,155,318127,040,0001,250,0002,113,536
7Aug 4, 2026 07:4326,214136,834,370127,437,0001,016,0002,113,536
8Aug 4, 2026 07:4326,451138,150,294128,591,0001,019,0002,113,536
9Aug 4, 2026 07:4328,170146,472,992137,030,0001,004,0002,113,536