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 5, 2026 00:32Victor MerckléVictor MerckléScore: 59,865Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 00:3259,749301,907,309290,634,0002,138,0002,113,536
2Jun 5, 2026 00:3259,750301,810,648290,683,0002,094,0002,113,536
3Jun 5, 2026 00:3259,768302,001,285290,705,0002,161,0002,113,536
4Jun 5, 2026 00:3259,772303,107,268290,810,0002,076,0002,113,536
5Jun 5, 2026 00:3259,865302,498,863291,201,0002,140,0002,113,536
6Jun 5, 2026 00:3259,866302,392,663291,207,0002,138,0002,113,536
7Jun 5, 2026 00:3259,887302,628,112291,431,0002,016,0002,113,536
8Jun 5, 2026 00:3259,901302,682,239291,318,0002,198,0002,113,536
9Jun 5, 2026 00:3260,146303,813,530292,529,0002,191,0002,113,536