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 listJul 9, 2026 09:25Victor MerckléVictor MerckléScore: 31,815Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 09:2531,418161,824,149152,941,0001,009,0002,117,632stderr
2Jul 9, 2026 09:2531,423162,097,180152,963,0001,011,0002,117,632stderr
3Jul 9, 2026 09:2531,442161,978,821153,058,0001,008,0002,117,632stderr
4Jul 9, 2026 09:2531,614162,787,443152,890,0002,022,0002,117,632stderr
5Jul 9, 2026 09:2531,815163,816,441154,885,0001,013,0002,117,632stderr
6Jul 9, 2026 09:2531,982164,580,365155,704,0001,010,0002,117,632stderr
7Jul 9, 2026 09:2532,017164,762,194155,873,0001,011,0002,117,632stderr
8Jul 9, 2026 09:2532,106165,184,722156,313,0001,011,0002,117,632stderr
9Jul 9, 2026 09:2532,108166,754,723156,321,0001,012,0002,117,632stderr