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 2, 2026 14:49Josu San MartinJosu San MartinScore: 30,624Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 14:5030,538160,231,756148,521,0001,117,0002,113,536
2Aug 2, 2026 14:5030,548160,443,039148,561,0001,127,0002,113,536
3Aug 2, 2026 14:5030,551159,693,709148,592,0001,111,0002,113,536
4Aug 2, 2026 14:5030,583160,047,028148,750,0001,111,0002,113,536
5Aug 2, 2026 14:5030,624160,012,110148,939,0001,120,0002,113,536
6Aug 2, 2026 14:5030,800160,961,695149,808,0001,116,0002,113,536
7Aug 2, 2026 14:5030,807160,995,704149,838,0001,118,0002,113,536
8Aug 2, 2026 14:5030,844161,235,152150,013,0001,127,0002,113,536
9Aug 2, 2026 14:5030,866161,299,664150,113,0001,134,0002,113,536