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 4, 2026 00:00Victor MerckléVictor MerckléScore: 47,918Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 00:0147,865242,297,288232,401,0002,138,0002,117,632stderr
2Jul 4, 2026 00:0147,868242,504,461232,412,0002,142,0002,117,632stderr
3Jul 4, 2026 00:0147,912242,515,973232,628,0002,145,0002,117,632stderr
4Jul 4, 2026 00:0147,914242,813,645232,618,0002,161,0002,117,632stderr
5Jul 4, 2026 00:0147,918243,162,965232,788,0002,014,0002,117,632stderr
6Jul 4, 2026 00:0148,054243,463,389233,302,0002,164,0002,117,632stderr
7Jul 4, 2026 00:0148,366244,857,535234,932,0002,063,0002,117,632stderr
8Jul 4, 2026 00:0148,972248,307,698237,872,0002,091,0002,117,632stderr
9Jul 4, 2026 00:0149,846252,150,237242,115,0002,134,0002,117,632stderr