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 08:54Josu San MartinJosu San MartinScore: 26,127Success
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 08:5826,054135,883,783126,477,0001,192,0002,113,536
2Aug 4, 2026 08:5826,060135,693,252126,427,0001,270,0002,113,536
3Aug 4, 2026 08:5826,064135,924,234126,530,0001,186,0002,113,536
4Aug 4, 2026 08:5826,092135,841,600126,665,0001,189,0002,113,536
5Aug 4, 2026 08:5826,127136,132,166126,839,0001,185,0002,113,536
6Aug 4, 2026 08:5826,136136,103,643127,058,0001,011,0002,113,536
7Aug 4, 2026 08:5826,161136,173,171126,926,0001,265,0002,113,536
8Aug 4, 2026 08:5826,205136,645,656127,145,0001,263,0002,113,536
9Aug 4, 2026 08:5831,159160,848,028151,415,0001,268,0002,113,536