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 18:22Victor MerckléVictor MerckléScore: 42,018Success
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 18:2241,638212,093,828202,003,0002,025,0002,117,632stderr
2Jul 5, 2026 18:2241,688212,306,922203,266,0001,006,00024,576stderr
3Jul 5, 2026 18:2241,696212,411,917203,308,0001,006,00024,576stderr
4Jul 5, 2026 18:2241,943213,654,567203,511,0002,011,0002,117,632stderr
5Jul 5, 2026 18:2242,018213,688,513204,884,0001,006,00024,576stderr
6Jul 5, 2026 18:2242,380215,668,090206,656,0001,006,00024,576stderr
7Jul 5, 2026 18:2242,395215,814,272206,728,0001,009,00024,576stderr
8Jul 5, 2026 18:2242,548216,519,567207,480,0001,006,00024,576stderr
9Jul 5, 2026 18:2243,354220,332,837211,434,0001,005,00024,576stderr