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:54Karthik ReddyKarthik ReddyScore: 23,995Success
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:5523,954126,297,825116,311,0001,065,00020,480
2Oct 12, 2026 20:5523,981126,432,595116,428,0001,081,00020,480
3Oct 12, 2026 20:5523,988126,464,823116,469,0001,073,00020,480
4Oct 12, 2026 20:5523,992126,470,488116,497,0001,067,00020,480
5Oct 12, 2026 20:5523,995126,530,768116,493,0001,084,00020,480
6Oct 12, 2026 20:5524,000126,496,617116,527,0001,075,00020,480
7Oct 12, 2026 20:5524,003126,555,549116,549,0001,069,00020,480
8Oct 12, 2026 20:5524,007126,485,246116,574,0001,064,00020,480
9Oct 12, 2026 20:5524,147127,268,940117,248,0001,075,00020,480