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 7, 2026 03:38Karthik ReddyKarthik ReddyScore: 26,492Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 7, 2026 03:3824,953131,230,459121,251,0001,023,0002,113,536
2Oct 7, 2026 03:3824,961131,247,745121,287,0001,023,0002,113,536
3Oct 7, 2026 03:3824,964131,267,936121,299,0001,027,0002,113,536
4Oct 7, 2026 03:3826,492138,759,335121,587,0008,228,0002,113,536
5Oct 7, 2026 03:3826,492140,308,952121,567,0008,245,0002,113,536
6Oct 7, 2026 03:3826,701139,827,637122,728,0008,110,0002,113,536
7Oct 7, 2026 03:3830,064156,306,438121,534,00025,780,00020,480
8Oct 7, 2026 03:3830,332157,680,395122,209,00026,422,00020,480
9Oct 7, 2026 03:3830,339157,624,168121,582,00027,080,00020,480