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 listJun 19, 2026 18:58Victor MerckléVictor MerckléScore: 49,440Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 18:5949,378249,413,147239,938,0002,016,0002,113,536
2Jun 19, 2026 18:5949,379249,622,296239,947,0002,012,0002,113,536
3Jun 19, 2026 18:5949,384249,624,944240,980,0001,006,0002,113,536
4Jun 19, 2026 18:5949,434249,816,890240,217,0002,013,0002,113,536
5Jun 19, 2026 18:5949,440249,799,209240,214,0002,043,0002,113,536
6Jun 19, 2026 18:5949,472250,039,979240,401,0002,015,0002,113,536
7Jun 19, 2026 18:5949,474251,402,416240,400,0002,027,0002,113,536
8Jun 19, 2026 18:5949,519250,080,946240,613,0002,032,0002,113,536
9Jun 19, 2026 18:5949,774251,471,520241,871,0002,023,0002,113,536