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 14:45Josu San MartinJosu San MartinScore: 25,183Success
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 14:4525,166131,676,909122,069,0001,248,0002,113,536
2Aug 4, 2026 14:4525,175131,645,682122,184,0001,176,0002,113,536
3Aug 4, 2026 14:4525,176131,909,650122,107,0001,257,0002,113,536
4Aug 4, 2026 14:4525,180131,783,087122,120,0001,263,0002,113,536
5Aug 4, 2026 14:4525,183131,807,057122,137,0001,260,0002,113,536
6Aug 4, 2026 14:4525,187131,913,333122,153,0001,266,0002,113,536
7Aug 4, 2026 14:4525,191131,817,760122,250,0001,188,0002,113,536
8Aug 4, 2026 14:4525,208133,359,758122,256,0001,264,0002,113,536
9Aug 4, 2026 14:4527,255142,004,776132,294,0001,260,0002,113,536