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 17, 2026 13:29Victor MerckléVictor MerckléScore: 52,682Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 13:3052,618266,901,645255,621,0002,212,0002,113,536
2Jun 17, 2026 13:3052,622267,533,271255,619,0002,230,0002,113,536
3Jun 17, 2026 13:3052,639267,072,716255,744,0002,189,0002,113,536
4Jun 17, 2026 13:3052,671267,247,776255,879,0002,212,0002,113,536
5Jun 17, 2026 13:3052,682267,247,273255,919,0002,224,0002,113,536
6Jun 17, 2026 13:3052,691267,220,119255,949,0002,237,0002,113,536
7Jun 17, 2026 13:3052,703267,319,131256,196,0002,051,0002,113,536
8Jun 17, 2026 13:3053,756272,685,832261,170,0002,239,0002,113,536
9Jun 17, 2026 13:3053,778272,604,486261,274,0002,241,0002,113,536