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 22:49Dominique GarmierDominique GarmierScore: 1,561,610Success
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 20:521,559,1677,673,952,7447,639,919,00002,289,664
2Mar 26, 2026 22:491,559,1837,665,499,7847,639,999,00002,347,008
3Mar 26, 2026 20:521,560,5057,672,066,7867,645,477,000999,0002,289,664
4Mar 26, 2026 20:521,561,6107,684,485,6597,648,893,0002,998,0002,285,568
5Mar 26, 2026 22:491,562,4837,685,321,5997,654,170,0001,998,0002,289,664
6Mar 26, 2026 22:491,562,6787,694,225,6557,656,125,000999,0002,289,664