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:28Karthik ReddyKarthik ReddyScore: 23,717Success
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:2923,655124,866,888114,847,0001,067,00020,480
2Oct 12, 2026 20:2923,661124,847,014114,894,0001,048,00020,480
3Oct 12, 2026 20:2923,663124,894,450114,901,0001,050,00020,480
4Oct 12, 2026 20:2923,675124,926,935114,931,0001,077,00020,480
5Oct 12, 2026 20:2923,717125,465,944115,132,0001,085,00020,480
6Oct 12, 2026 20:2923,755125,336,423115,311,0001,093,00020,480
7Oct 12, 2026 20:2923,826125,700,075115,690,0001,062,00020,480
8Oct 12, 2026 20:2923,936126,217,510116,203,0001,087,00020,480
9Oct 12, 2026 20:2924,000126,560,544116,540,0001,063,00020,480