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 7, 2026 18:52Victor MerckléVictor MerckléScore: 32,862Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 18:5332,684168,018,271154,934,0005,222,00024,576stderr
2Jul 7, 2026 18:5332,803168,528,634155,123,0005,615,00024,576stderr
3Jul 7, 2026 18:5332,804168,519,770154,784,0005,957,0002,117,632stderr
4Jul 7, 2026 18:5332,853170,391,629155,458,0005,524,00024,576stderr
5Jul 7, 2026 18:5332,862168,832,398154,925,0006,102,00024,576stderr
6Jul 7, 2026 18:5333,051170,053,081157,076,0004,875,00024,576stderr
7Jul 7, 2026 18:5333,058169,965,086156,309,0005,676,00024,576stderr
8Jul 7, 2026 18:5333,135170,202,373156,352,0006,014,00024,576stderr
9Jul 7, 2026 18:5333,148170,436,676157,250,0005,179,00024,576stderr