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 8, 2026 10:13Victor MerckléVictor MerckléScore: 62,473Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 10:1462,305314,372,079303,213,0002,084,0002,113,536
2Jun 8, 2026 10:1462,353314,680,402303,509,0002,024,0002,113,536
3Jun 8, 2026 10:1462,368314,717,272303,481,0002,123,0002,113,536
4Jun 8, 2026 10:1462,371317,258,983303,528,0002,090,0002,113,536
5Jun 8, 2026 10:1462,473315,261,903304,031,0002,090,0002,113,536
6Jun 8, 2026 10:1462,509315,389,289304,245,0002,051,0002,113,536
7Jun 8, 2026 10:1462,518315,538,370304,296,0002,047,0002,113,536
8Jun 8, 2026 10:1462,533315,812,842304,284,0002,132,0002,113,536
9Jun 8, 2026 10:1462,569316,520,623304,552,0002,040,0002,113,536