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 18:35Jasper EdbrookeJasper EdbrookeScore: 280,860Success
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 18:35280,7341,399,023,3811,259,630,000115,965,0002,473,984
2Mar 26, 2026 18:35280,7431,397,104,9101,277,665,00097,974,0002,289,664
3Mar 26, 2026 18:35280,7931,399,786,9151,268,895,000106,991,0002,289,664
4Mar 26, 2026 18:35280,8271,405,229,4951,278,120,00097,932,0002,281,472
5Mar 26, 2026 18:35280,8601,401,118,4251,262,280,000113,935,0002,473,984
6Mar 26, 2026 18:35280,9041,401,478,2471,265,476,000110,954,0002,473,984
7Mar 26, 2026 18:35280,9231,399,770,0371,273,559,000102,964,0002,469,888
8Mar 26, 2026 18:35281,0611,404,829,4891,262,265,000114,933,0002,289,664
9Mar 26, 2026 18:35281,1101,404,899,2151,266,483,000110,954,0002,281,472