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 listOct 13, 2026 02:04Karthik ReddyKarthik ReddyScore: 23,335Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 02:0523,274122,987,267112,981,0001,064,00020,480
2Oct 13, 2026 02:0523,301123,070,873113,088,0001,091,00020,480
3Oct 13, 2026 02:0523,325123,221,231113,230,0001,066,00020,480
4Oct 13, 2026 02:0523,327123,301,955113,242,0001,063,00020,480
5Oct 13, 2026 02:0523,335129,231,302113,277,0001,069,00020,480
6Oct 13, 2026 02:0523,342125,406,525113,277,0001,101,00020,480
7Oct 13, 2026 02:0523,343123,314,540113,305,0001,078,00020,480
8Oct 13, 2026 02:0523,355123,327,663113,360,0001,080,00020,480
9Oct 13, 2026 02:0523,395123,589,571113,574,0001,064,00020,480