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 3, 2026 08:27Victor MerckléVictor MerckléScore: 49,700Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 08:3049,639251,129,283241,225,0002,009,0002,117,632stderr
2Jul 3, 2026 08:3049,663251,235,946241,304,0002,048,0002,117,632stderr
3Jul 3, 2026 08:3049,666251,244,308241,310,0002,056,0002,117,632stderr
4Jul 3, 2026 08:3049,686251,435,115241,360,0002,105,0002,117,632stderr
5Jul 3, 2026 08:3049,700251,523,087241,424,0002,110,0002,117,632stderr
6Jul 3, 2026 08:3049,705251,586,631241,482,0002,075,0002,117,632stderr
7Jul 3, 2026 08:3049,719251,533,191241,500,0002,125,0002,117,632stderr
8Jul 3, 2026 08:3049,793251,953,441241,855,0002,134,0002,117,632stderr
9Jul 3, 2026 08:3050,025253,003,971243,087,0002,037,0002,117,632stderr