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 listJul 18, 2025 01:02zielajzielajScore: 33,065Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2025 01:0233,046180,874,467160,926,000999,0002,310,144
2Jul 18, 2025 01:0233,059184,739,401160,989,000999,0002,457,600
3Jul 18, 2025 01:0233,061189,175,695158,001,0004,000,0002,445,312
4Jul 18, 2025 01:0233,062185,951,690161,005,0001,000,0002,314,240
5Jul 18, 2025 01:0233,065186,213,563161,017,0001,000,0002,285,568
6Jul 18, 2025 01:0233,071186,011,332160,050,0002,000,0002,281,472
7Jul 18, 2025 01:0233,083190,377,661160,106,0002,001,0002,306,048
8Jul 18, 2025 01:0234,153184,866,474166,347,0001,002,0002,297,856
9Jul 18, 2025 01:0236,089198,228,912174,840,0001,998,0002,322,432