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 19:45Josu San MartinJosu San MartinScore: 30,674Success
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 19:4630,424159,074,840147,972,0001,106,0002,113,536
2Aug 2, 2026 19:4630,452159,347,885148,090,0001,128,0002,113,536
3Aug 2, 2026 19:4630,474159,243,072148,211,0001,114,0002,113,536
4Aug 2, 2026 19:4630,567159,771,469148,647,0001,132,0002,113,536
5Aug 2, 2026 19:4630,674160,496,283149,180,0001,127,0002,113,536
6Aug 2, 2026 19:4630,999161,926,619150,776,0001,123,0002,113,536
7Aug 2, 2026 19:4631,054162,180,514151,041,0001,126,0002,113,536
8Aug 2, 2026 19:4631,087162,535,683151,195,0001,135,0002,113,536
9Aug 2, 2026 19:4638,162197,038,777185,879,0001,116,0002,113,536