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 listNov 11, 2025 00:58izotoffizotoffScore: 1,250,269Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2025 00:581,231,2506,066,185,1646,031,125,0001,998,0002,326,528
2Nov 11, 2025 00:561,233,7496,070,552,0766,043,373,0001,998,0002,326,528
3Nov 11, 2025 00:561,246,8516,142,724,9726,107,574,0001,998,0002,326,528
4Nov 11, 2025 00:561,250,2696,160,352,9016,126,316,00002,326,528
5Nov 11, 2025 00:581,250,2896,154,119,9806,124,417,0001,998,0002,326,528
6Nov 11, 2025 00:581,250,2956,162,809,0066,122,448,0003,997,0002,326,528