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 18, 2026 11:33Victor MerckléVictor MerckléScore: 56,395Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 11:3456,354284,560,596273,964,0002,174,0002,113,536
2Jun 18, 2026 11:3456,359283,813,631274,097,0002,066,0002,113,536
3Jun 18, 2026 11:3456,380283,915,768274,172,0002,092,0002,113,536
4Jun 18, 2026 11:3456,382283,877,979274,106,0002,168,0002,113,536
5Jun 18, 2026 11:3456,395284,393,403274,320,0002,016,0002,113,536
6Jun 18, 2026 11:3456,425285,222,643274,404,0002,080,0002,113,536
7Jun 18, 2026 11:3456,475284,325,914274,671,0002,057,0002,113,536
8Jun 18, 2026 11:3456,729285,606,691275,943,0002,030,0002,113,536
9Jun 18, 2026 11:3456,901286,311,531276,658,0002,159,0002,113,536