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 13, 2026 02:33Victor MerckléVictor MerckléScore: 56,326Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 02:3356,260283,299,048273,559,0002,119,0002,113,536
2Jun 13, 2026 02:3356,301283,554,029273,717,0002,160,0002,113,536
3Jun 13, 2026 02:3356,310283,467,184273,908,0002,013,0002,113,536
4Jun 13, 2026 02:3356,313283,894,489273,736,0002,200,0002,113,536
5Jun 13, 2026 02:3356,326283,673,968273,992,0002,007,0002,113,536
6Jun 13, 2026 02:3356,417283,959,160274,331,0002,115,0002,113,536
7Jun 13, 2026 02:3356,448284,261,979274,431,0002,169,0002,113,536
8Jun 13, 2026 02:3356,659285,205,462275,457,0002,175,0002,113,536
9Jun 13, 2026 02:3356,668285,430,199275,516,0002,160,0002,113,536