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:48Josu San MartinJosu San MartinScore: 30,673Success
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:4830,639158,612,524148,870,0001,263,0002,113,536
2Aug 3, 2026 07:4830,650158,631,663149,172,0001,017,0002,113,536
3Aug 3, 2026 07:4830,662158,682,326148,983,0001,262,0002,113,536
4Aug 3, 2026 07:4830,665162,170,901149,213,0001,046,0002,113,536
5Aug 3, 2026 07:4830,673158,754,957149,249,0001,050,0002,113,536
6Aug 3, 2026 07:4830,702158,906,770149,431,0001,011,0002,113,536
7Aug 3, 2026 07:4830,706158,968,646149,427,0001,037,0002,113,536
8Aug 3, 2026 07:4830,874159,727,295150,016,0001,270,0002,113,536
9Aug 3, 2026 07:4831,617163,410,413153,889,0001,039,0002,113,536