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 12:14Victor MerckléVictor MerckléScore: 52,856Success
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:1552,627265,492,669255,798,0002,076,0002,113,536
2Jun 19, 2026 12:1552,636266,616,856255,865,0002,054,0002,113,536
3Jun 19, 2026 12:1552,640265,591,218255,861,0002,079,0002,113,536
4Jun 19, 2026 12:1552,847266,616,274256,883,0002,072,0002,113,536
5Jun 19, 2026 12:1552,856266,940,518256,882,0002,117,0002,113,536
6Jun 19, 2026 12:1552,864266,691,711256,992,0002,042,0002,113,536
7Jun 19, 2026 12:1552,988267,741,422257,580,0002,065,0002,113,536
8Jun 19, 2026 12:1553,127268,065,907258,065,0002,262,0002,113,536
9Jun 19, 2026 12:1554,331273,866,260264,077,0002,147,0002,113,536