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:19Victor MerckléVictor MerckléScore: 50,086Success
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:2050,027252,997,356243,035,0002,100,0002,117,632stderr
2Jul 3, 2026 08:2050,052253,241,550243,092,0002,165,0002,117,632stderr
3Jul 3, 2026 08:2050,064253,272,770243,241,0002,074,0002,117,632stderr
4Jul 3, 2026 08:2050,064253,289,311243,113,0002,204,0002,117,632stderr
5Jul 3, 2026 08:2050,086253,344,771243,297,0002,126,0002,117,632stderr
6Jul 3, 2026 08:2050,087253,190,929243,308,0002,123,0002,117,632stderr
7Jul 3, 2026 08:2050,182253,812,325243,724,0002,172,0002,117,632stderr
8Jul 3, 2026 08:2051,145258,541,326248,467,0002,148,0002,117,632stderr
9Jul 3, 2026 08:2051,324259,396,634249,357,0002,132,0002,117,632stderr