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 12, 2026 20:52Karthik ReddyKarthik ReddyScore: 23,867Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 20:5223,799125,607,605115,543,0001,073,00020,480
2Oct 12, 2026 20:5223,820125,587,536115,636,0001,083,00020,480
3Oct 12, 2026 20:5223,830125,743,186115,679,0001,089,00020,480
4Oct 12, 2026 20:5223,859125,824,443115,827,0001,083,00020,480
5Oct 12, 2026 20:5223,867126,422,370115,854,0001,095,00020,480
6Oct 12, 2026 20:5223,871125,836,800115,890,0001,080,00020,480
7Oct 12, 2026 20:5223,887126,030,462115,971,0001,080,00020,480
8Oct 12, 2026 20:5223,888125,951,501115,990,0001,066,00020,480
9Oct 12, 2026 20:5223,903126,032,020116,024,0001,105,00020,480