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 10:53Josu San MartinJosu San MartinScore: 30,176Success
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 10:5430,130156,746,028146,376,0001,263,0002,113,536
2Aug 3, 2026 10:5430,137156,074,692146,409,0001,263,0002,113,536
3Aug 3, 2026 10:5430,139156,818,947146,431,0001,252,0002,113,536
4Aug 3, 2026 10:5430,143156,804,901146,434,0001,271,0002,113,536
5Aug 3, 2026 10:5430,176156,975,309146,611,0001,256,0002,113,536
6Aug 3, 2026 10:5430,178156,365,636146,707,0001,166,0002,113,536
7Aug 3, 2026 10:5430,186156,339,083146,664,0001,250,0002,113,536
8Aug 3, 2026 10:5430,496157,867,592148,168,0001,266,0002,113,536
9Aug 3, 2026 10:5430,854160,266,709149,916,0001,272,0002,113,536