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 1, 2026 12:23Josu San MartinJosu San MartinScore: 35,685Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 12:2435,682184,947,611173,729,0001,113,0002,113,536
2Aug 1, 2026 12:2435,682185,000,628173,731,0001,111,0002,113,536
3Aug 1, 2026 12:2435,684185,135,826173,745,0001,111,0002,113,536
4Aug 1, 2026 12:2435,684184,995,016173,744,0001,108,0002,113,536
5Aug 1, 2026 12:2435,685184,957,982173,734,0001,124,0002,113,536
6Aug 1, 2026 12:2435,686185,087,043173,750,0001,116,0002,113,536
7Aug 1, 2026 12:2435,688184,936,697173,743,0001,129,0002,113,536
8Aug 1, 2026 12:2435,695184,988,306173,787,0001,122,0002,113,536
9Aug 1, 2026 12:2435,706185,864,794173,836,0001,124,0002,113,536