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 29, 2026 12:49Dominique GarmierDominique GarmierScore: 235,914Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 31, 2026 12:12235,5381,179,323,1641,152,139,0001,998,0002,293,760
2Mar 31, 2026 12:12235,5741,179,465,2221,151,317,0002,998,0002,424,832
3Mar 29, 2026 12:49235,6901,183,764,4221,150,880,0003,999,0002,289,664
4Mar 29, 2026 12:49235,9141,177,951,6161,150,980,0004,999,0002,494,464
5Mar 31, 2026 12:12236,7481,186,205,4851,157,065,0003,000,0002,289,664
6Mar 29, 2026 12:49236,8531,188,072,7491,156,584,0003,998,0002,478,080