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 06:39Dominique GarmierDominique GarmierScore: 2,429,668Success
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 02:222,423,69211,912,250,01111,874,092,0001,999,0002,281,472
2Mar 27, 2026 06:392,425,88811,919,854,03811,884,854,0001,998,0002,285,568
3Mar 27, 2026 02:222,426,72911,933,816,58911,888,975,0001,998,0002,277,376
4Mar 27, 2026 02:222,429,66811,955,063,45511,903,374,0001,998,0002,285,568
5Mar 27, 2026 06:392,433,86411,959,963,24411,924,933,000999,0002,289,664
6Mar 27, 2026 06:392,434,64611,957,597,77311,927,765,0001,999,0002,289,664