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 06:41Victor MerckléVictor MerckléScore: 48,371Success
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 06:4248,323244,727,362234,646,0002,141,0002,117,632stderr
2Jul 3, 2026 06:4248,327245,092,020234,784,0002,022,0002,117,632stderr
3Jul 3, 2026 06:4248,338244,787,333234,829,0002,031,0002,117,632stderr
4Jul 3, 2026 06:4248,356244,805,965234,885,0002,061,0002,117,632stderr
5Jul 3, 2026 06:4248,371244,997,663234,926,0002,092,0002,117,632stderr
6Jul 3, 2026 06:4248,427245,221,917235,250,0002,047,0002,117,632stderr
7Jul 3, 2026 06:4249,349249,767,420239,611,0002,201,0002,117,632stderr
8Jul 3, 2026 06:4249,690251,375,731241,466,0002,017,0002,117,632stderr
9Jul 3, 2026 06:4249,799252,340,960241,992,0002,024,0002,117,632stderr