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 17, 2026 21:31Pavel SkripkinPavel SkripkinScore: 200,363Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 21:31200,2511,006,249,421979,233,0001,998,0002,428,928
2Mar 17, 2026 21:31200,2741,010,203,556979,343,0001,998,0002,535,424
3Mar 17, 2026 21:31200,3051,006,153,476979,497,0001,998,0002,535,424
4Mar 17, 2026 21:31200,3351,007,238,004980,641,000999,0002,428,928
5Mar 17, 2026 21:31200,3631,006,487,720980,780,000999,0002,277,376
6Mar 17, 2026 21:31200,3931,003,794,043980,926,000999,0002,424,832
7Mar 17, 2026 21:31200,3971,007,943,477980,946,000999,0002,424,832
8Mar 17, 2026 21:31200,4031,013,549,056980,974,000999,0002,277,376
9Mar 17, 2026 21:31200,4721,014,114,726981,313,000999,0002,433,024