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 10, 2025 23:44izotoffizotoffScore: 1,059,050Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 10, 2025 23:441,058,9075,223,843,5075,185,644,0002,998,0002,326,528
2Nov 10, 2025 23:441,058,9645,215,555,6545,188,926,00002,326,528
3Nov 10, 2025 23:441,058,9945,219,764,5955,188,072,000999,0002,543,616
4Nov 10, 2025 23:441,059,0175,214,596,0175,187,185,0001,998,0002,326,528
5Nov 10, 2025 23:441,059,0505,216,635,8315,186,350,0002,997,0002,326,528
6Nov 10, 2025 23:441,059,0535,218,885,6175,184,362,0004,997,0002,326,528
7Nov 10, 2025 23:441,059,0665,214,008,1285,186,424,0002,998,0002,326,528
8Nov 10, 2025 23:441,059,0765,213,024,9265,187,471,0001,999,0002,326,528
9Nov 10, 2025 23:441,059,1025,221,200,0925,187,603,0001,998,0002,326,528