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 04:24Victor MerckléVictor MerckléScore: 49,908Success
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 04:2449,851252,013,817242,261,0002,012,0002,117,632stderr
2Jul 4, 2026 04:2449,866252,128,784242,316,0002,028,0002,117,632stderr
3Jul 4, 2026 04:2449,882252,382,858242,390,0002,036,0002,117,632stderr
4Jul 4, 2026 04:2449,886252,405,875242,383,0002,059,0002,117,632stderr
5Jul 4, 2026 04:2449,908252,360,155242,548,0002,004,0002,117,632stderr
6Jul 4, 2026 04:2449,914252,548,887242,542,0002,040,0002,117,632stderr
7Jul 4, 2026 04:2449,922252,563,138242,595,0002,024,0002,117,632stderr
8Jul 4, 2026 04:2450,280254,073,959244,337,0002,039,0002,117,632stderr
9Jul 4, 2026 04:2450,568255,554,342245,743,0002,041,0002,117,632stderr