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 12, 2026 02:29Victor MerckléVictor MerckléScore: 55,410Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 02:3055,386280,446,158269,374,0002,021,0002,113,536
2Jun 12, 2026 02:3055,390280,417,952269,182,0002,231,0002,113,536
3Jun 12, 2026 02:3055,397280,489,874269,433,0002,017,0002,113,536
4Jun 12, 2026 02:3055,409280,769,686269,473,0002,033,0002,113,536
5Jun 12, 2026 02:3055,410281,655,896269,275,0002,238,0002,113,536
6Jun 12, 2026 02:3055,411280,623,493269,486,0002,031,0002,113,536
7Jun 12, 2026 02:3055,482280,927,572269,846,0002,018,0002,113,536
8Jun 12, 2026 02:3055,493280,965,289269,900,0002,018,0002,113,536
9Jun 12, 2026 02:3056,276284,807,919273,745,0002,010,0002,113,536