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 25, 2026 13:40Victor MerckléVictor MerckléScore: 61,450Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 13:4161,359308,281,294298,651,0002,012,0002,113,536
2Jun 25, 2026 13:4161,401308,563,996298,797,0002,071,0002,113,536
3Jun 25, 2026 13:4161,406308,999,524298,759,0002,132,0002,113,536
4Jun 25, 2026 13:4161,414308,647,798298,922,0002,011,0002,113,536
5Jun 25, 2026 13:4161,450308,741,210298,949,0002,160,0002,113,536
6Jun 25, 2026 13:4161,450309,135,430299,076,0002,033,0002,113,536
7Jun 25, 2026 13:4161,460308,835,712298,942,0002,214,0002,113,536
8Jun 25, 2026 13:4161,506309,023,183299,367,0002,013,0002,113,536
9Jun 25, 2026 13:4163,003316,374,370306,571,0002,147,0002,113,536