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 23:15izotoffizotoffScore: 519,617Success
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 23:15519,5432,570,011,6422,538,763,0006,996,0002,326,528
2Nov 11, 2025 23:15519,5942,578,185,3682,541,015,0004,998,0002,326,528
3Nov 11, 2025 23:15519,6112,576,422,3662,539,099,0006,994,0002,322,432
4Nov 11, 2025 23:15519,6142,576,788,6792,542,111,0003,998,0002,326,528
5Nov 11, 2025 23:15519,6172,573,488,8222,542,126,0003,997,0002,437,120
6Nov 11, 2025 23:15519,6472,579,661,3762,542,274,0003,997,0002,445,312
7Nov 11, 2025 23:15519,6532,571,730,2002,540,304,0005,995,0002,326,528
8Nov 11, 2025 23:15519,6592,574,653,0502,542,333,0003,997,0002,326,528
9Nov 11, 2025 23:15519,7362,574,660,9582,540,712,0005,996,0002,326,528