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 15:01Josu San MartinJosu San MartinScore: 25,787Success
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 15:0225,749134,533,182124,924,0001,250,0002,113,536
2Aug 4, 2026 15:0225,759137,050,198125,211,0001,011,0002,113,536
3Aug 4, 2026 15:0225,767134,618,994125,005,0001,257,0002,113,536
4Aug 4, 2026 15:0225,783134,650,751125,070,0001,268,0002,113,536
5Aug 4, 2026 15:0225,787134,806,611125,301,0001,057,0002,113,536
6Aug 4, 2026 15:0225,795134,853,376125,136,0001,261,0002,113,536
7Aug 4, 2026 15:0225,803134,749,801125,188,0001,250,0002,113,536
8Aug 4, 2026 15:0225,808134,807,786125,216,0001,246,0002,113,536
9Aug 4, 2026 15:0225,809134,823,267125,213,0001,253,0002,113,536