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 07:08Josu San MartinJosu San MartinScore: 30,847Success
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 07:0930,802159,508,602149,687,0001,245,0002,113,536
2Aug 3, 2026 07:0930,834159,946,897149,828,0001,260,0002,113,536
3Aug 3, 2026 07:0930,843160,239,894149,859,0001,276,0002,113,536
4Aug 3, 2026 07:0930,846159,615,009149,892,0001,258,0002,113,536
5Aug 3, 2026 07:0930,847159,603,732150,116,0001,038,0002,113,536
6Aug 3, 2026 07:0930,851159,330,294150,158,0001,012,0002,113,536
7Aug 3, 2026 07:0930,880159,711,262150,210,0001,103,0002,113,536
8Aug 3, 2026 07:0931,427162,416,115152,728,0001,268,0002,113,536
9Aug 3, 2026 07:0932,913169,481,503160,267,0001,007,0002,113,536