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 27, 2026 19:26Dominique GarmierDominique GarmierScore: 1,764,721Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 19:261,760,9628,654,854,4128,627,713,000999,0002,289,664
2Mar 28, 2026 08:071,761,6998,663,354,6278,632,325,00002,285,568
3Mar 28, 2026 08:071,761,9788,663,636,0378,633,693,00002,289,664
4Mar 27, 2026 19:261,764,7218,673,515,6358,645,133,0001,998,0002,351,104
5Mar 27, 2026 19:261,765,4298,687,026,2988,650,600,00002,285,568
6Mar 28, 2026 08:071,782,1498,768,203,6988,731,533,000999,0002,285,568