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 4, 2026 04:11Josu San MartinJosu San MartinScore: 27,475Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 04:1227,429143,442,239133,398,0001,007,0002,113,536
2Aug 4, 2026 04:1227,439143,492,103133,196,0001,257,0002,113,536
3Aug 4, 2026 04:1227,441142,901,880133,210,0001,255,0002,113,536
4Aug 4, 2026 04:1227,451142,927,455133,247,0001,266,0002,113,536
5Aug 4, 2026 04:1227,475143,100,815133,624,0001,006,0002,113,536
6Aug 4, 2026 04:1227,502143,147,176133,486,0001,277,0002,113,536
7Aug 4, 2026 04:1227,507143,258,441133,511,0001,274,0002,113,536
8Aug 4, 2026 04:1227,507143,176,715133,532,0001,256,0002,113,536
9Aug 4, 2026 04:1227,528143,255,371133,633,0001,258,0002,113,536