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 listMar 26, 2026 21:59Jasper EdbrookeJasper EdbrookeScore: 232,863Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 21:59232,1111,162,481,4411,063,388,00073,957,0002,281,472
2Mar 26, 2026 21:59232,1811,158,204,6861,043,713,00093,974,0002,281,472
3Mar 26, 2026 21:59232,2041,160,894,1421,034,818,000102,981,0002,281,472
4Mar 26, 2026 21:59232,6091,163,532,4461,031,807,000107,979,0002,510,848
5Mar 26, 2026 21:59232,8631,173,980,8001,029,027,000112,003,0002,285,568
6Mar 26, 2026 21:59232,9871,170,273,0581,036,669,000104,966,0002,281,472
7Mar 26, 2026 21:59232,9921,166,337,2601,023,698,000117,965,0002,289,664
8Mar 26, 2026 21:59233,0771,167,711,9021,027,171,000114,907,0002,281,472
9Mar 26, 2026 21:59233,2571,172,896,4061,024,068,000118,891,0002,289,664