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 19, 2026 11:59Victor MerckléVictor MerckléScore: 49,496Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 12:0049,156248,514,529238,815,0002,053,0002,113,536
2Jun 19, 2026 12:0049,235248,855,069239,226,0002,026,0002,113,536
3Jun 19, 2026 12:0049,470250,390,048240,364,0002,039,0002,113,536
4Jun 19, 2026 12:0049,473250,093,973240,382,0002,039,0002,113,536
5Jun 19, 2026 12:0049,496250,160,747240,491,0002,044,0002,113,536
6Jun 19, 2026 12:0049,511250,232,974240,579,0002,025,0002,113,536
7Jun 19, 2026 12:0049,523250,460,830240,620,0002,043,0002,113,536
8Jun 19, 2026 12:0049,572250,493,737240,854,0002,053,0002,113,536
9Jun 19, 2026 12:0049,989252,588,304242,914,0002,033,0002,113,536