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 1, 2026 19:38Victor MerckléVictor MerckléScore: 49,730Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 19:3849,704251,407,790241,548,0002,005,0002,117,632stderr
2Jul 1, 2026 19:3849,709251,927,458241,516,0002,060,0002,117,632stderr
3Jul 1, 2026 19:3849,709251,501,404241,565,0002,012,0002,117,632stderr
4Jul 1, 2026 19:3849,729251,599,437241,649,0002,024,0002,117,632stderr
5Jul 1, 2026 19:3849,730251,636,039241,636,0002,043,0002,117,632stderr
6Jul 1, 2026 19:3849,776251,905,683241,893,0002,011,0002,117,632stderr
7Jul 1, 2026 19:3849,780251,801,742241,889,0002,036,0002,117,632stderr
8Jul 1, 2026 19:3849,822252,033,674242,112,0002,020,0002,117,632stderr
9Jul 1, 2026 19:3850,630256,364,098246,051,0002,039,0002,117,632stderr