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 18, 2026 19:23Victor MerckléVictor MerckléScore: 52,283Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 19:2352,194263,727,337253,742,0002,013,0002,113,536
2Jun 18, 2026 19:2352,212263,488,531253,806,0002,037,0002,113,536
3Jun 18, 2026 19:2352,252264,766,418254,011,0002,024,0002,113,536
4Jun 18, 2026 19:2352,278263,817,886254,128,0002,039,0002,113,536
5Jun 18, 2026 19:2352,283263,591,553254,131,0002,057,0002,113,536
6Jun 18, 2026 19:2352,295263,896,988254,201,0002,048,0002,113,536
7Jun 18, 2026 19:2352,308263,885,078254,298,0002,016,0002,113,536
8Jun 18, 2026 19:2352,311264,017,495254,284,0002,042,0002,113,536
9Jun 18, 2026 19:2352,494265,279,107255,199,0002,024,0002,113,536