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 25, 2026 13:49Victor MerckléVictor MerckléScore: 57,166Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 13:5057,152287,676,692278,018,0002,031,0002,113,536
2Jun 25, 2026 13:5057,155287,770,769277,849,0002,211,0002,113,536
3Jun 25, 2026 13:5057,164287,849,806278,043,0002,062,0002,113,536
4Jun 25, 2026 13:5057,164287,852,467278,055,0002,053,0002,113,536
5Jun 25, 2026 13:5057,166287,796,809278,076,0002,040,0002,113,536
6Jun 25, 2026 13:5057,172287,795,686278,130,0002,017,0002,113,536
7Jun 25, 2026 13:5057,174287,925,012278,077,0002,079,0002,113,536
8Jun 25, 2026 13:5057,188288,379,346278,206,0002,019,0002,113,536
9Jun 25, 2026 13:5057,198288,106,370278,177,0002,097,0002,113,536