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 listJun 8, 2026 10:18Victor MerckléVictor MerckléScore: 52,917Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 10:1952,800267,891,740256,498,0002,224,0002,113,536
2Jun 8, 2026 10:1952,821268,009,432256,781,0002,043,0002,113,536
3Jun 8, 2026 10:1952,873268,252,611256,854,0002,224,0002,113,536
4Jun 8, 2026 10:1952,881268,768,878256,909,0002,208,0002,113,536
5Jun 8, 2026 10:1952,917268,401,311257,271,0002,023,0002,113,536
6Jun 8, 2026 10:1952,927268,525,527257,296,0002,051,0002,113,536
7Jun 8, 2026 10:1952,938268,557,113257,380,0002,019,0002,113,536
8Jun 8, 2026 10:1952,945271,153,572257,425,0002,008,0002,113,536
9Jun 8, 2026 10:1953,725272,377,366261,076,0002,177,0002,113,536