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 5, 2026 15:12Josu San MartinJosu San MartinScore: 29,391Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 5, 2026 15:1229,375152,400,267142,682,0001,258,0002,113,536
2Aug 5, 2026 15:1229,381152,394,567142,713,0001,256,0002,113,536
3Aug 5, 2026 15:1229,384152,928,768142,724,0001,262,0002,113,536
4Aug 5, 2026 15:1229,389152,492,488142,751,0001,256,0002,113,536
5Aug 5, 2026 15:1229,391152,422,984142,760,0001,259,0002,113,536
6Aug 5, 2026 15:1229,395152,408,454142,788,0001,252,0002,113,536
7Aug 5, 2026 15:1229,400152,531,071142,797,0001,267,0002,113,536
8Aug 5, 2026 15:1229,414152,578,568142,882,0001,247,0002,113,536
9Aug 5, 2026 15:1229,853154,756,010145,019,0001,263,0002,113,536