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 06:23Josu San MartinJosu San MartinScore: 29,564Success
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 06:2429,528153,124,817143,429,0001,263,0002,113,536
2Aug 3, 2026 06:2429,546153,254,697143,507,0001,273,0002,113,536
3Aug 3, 2026 06:2429,551155,855,512143,548,0001,254,0002,113,536
4Aug 3, 2026 06:2429,554153,239,975143,794,0001,021,0002,113,536
5Aug 3, 2026 06:2429,564153,540,568143,861,0001,004,0002,113,536
6Aug 3, 2026 06:2429,648154,306,249144,021,0001,259,0002,113,536
7Aug 3, 2026 06:2430,004156,595,066146,017,0001,007,0002,113,536
8Aug 3, 2026 06:2430,194157,055,964146,675,0001,279,0002,113,536
9Aug 3, 2026 06:2431,802164,120,221154,554,0001,278,0002,113,536