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:53Karthik ReddyKarthik ReddyScore: 23,757Success
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:5423,730126,690,214115,216,0001,065,00020,480
2Oct 12, 2026 20:5423,732125,645,419115,229,0001,062,00020,480
3Oct 12, 2026 20:5423,740125,255,016115,267,0001,060,00020,480
4Oct 12, 2026 20:5423,755125,279,989115,340,0001,062,00020,480
5Oct 12, 2026 20:5423,757125,380,700115,308,0001,105,00020,480
6Oct 12, 2026 20:5423,779125,440,418115,514,0001,006,00020,480
7Oct 12, 2026 20:5423,780125,428,850115,444,0001,079,00020,480
8Oct 12, 2026 20:5423,792130,079,885115,455,0001,129,00020,480
9Oct 12, 2026 20:5423,810125,678,110115,559,0001,113,00020,480