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:18Karthik ReddyKarthik ReddyScore: 24,162Success
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:1924,100126,978,245117,024,0001,067,00020,480
2Oct 12, 2026 20:1924,121127,138,582117,138,0001,059,00020,480
3Oct 12, 2026 20:1924,127127,155,984117,154,0001,071,00020,480
4Oct 12, 2026 20:1924,144127,238,058117,201,0001,106,00020,480
5Oct 12, 2026 20:1924,162127,351,004117,326,0001,072,00020,480
6Oct 12, 2026 20:1924,185127,402,119117,442,0001,067,00020,480
7Oct 12, 2026 20:1924,191127,450,094117,461,0001,078,00020,480
8Oct 12, 2026 20:1924,219127,556,496117,620,0001,054,00020,480
9Oct 12, 2026 20:1924,237127,656,646117,596,0001,168,00020,480