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 5, 2026 21:01Victor MerckléVictor MerckléScore: 37,620Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 21:0237,246190,415,089181,499,0001,008,0002,117,632stderr
2Jul 5, 2026 21:0237,252190,356,126180,525,0002,012,0002,117,632stderr
3Jul 5, 2026 21:0237,375190,996,108181,126,0002,015,0002,117,632stderr
4Jul 5, 2026 21:0237,533191,734,259181,745,0002,168,0002,117,632stderr
5Jul 5, 2026 21:0237,620192,294,890182,242,0002,096,0002,117,632stderr
6Jul 5, 2026 21:0237,637192,474,906182,353,0002,073,0002,117,632stderr
7Jul 5, 2026 21:0237,715192,564,622183,798,0001,007,0002,117,632stderr
8Jul 5, 2026 21:0237,795193,085,728183,128,0002,069,0002,117,632stderr
9Jul 5, 2026 21:0238,522196,596,648186,607,0002,155,0002,117,632stderr