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 5, 2026 00:14Victor MerckléVictor MerckléScore: 59,310Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 00:1459,225299,328,555288,050,0002,157,0002,113,536
2Jun 5, 2026 00:1459,278300,125,271288,185,0002,278,0002,113,536
3Jun 5, 2026 00:1459,284299,605,523288,307,0002,187,0002,113,536
4Jun 5, 2026 00:1459,300299,638,135288,374,0002,197,0002,113,536
5Jun 5, 2026 00:1459,310299,829,575288,490,0002,131,0002,113,536
6Jun 5, 2026 00:1459,416300,244,479289,029,0002,114,0002,113,536
7Jun 5, 2026 00:1459,490304,116,181289,246,0002,259,0002,113,536
8Jun 5, 2026 00:1460,184304,106,724292,727,0002,176,0002,113,536
9Jun 5, 2026 00:1460,966307,865,064296,589,0002,149,0002,113,536