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 7, 2026 06:16Karthik ReddyKarthik ReddyScore: 23,762Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 7, 2026 06:1623,717125,166,160115,160,0001,057,00020,480
2Oct 7, 2026 06:1623,723125,228,547115,170,0001,075,00020,480
3Oct 7, 2026 06:1623,744125,438,937115,278,0001,068,00020,480
4Oct 7, 2026 06:1623,756125,417,956115,342,0001,063,00020,480
5Oct 7, 2026 06:1623,762125,525,445115,366,0001,070,00020,480
6Oct 7, 2026 06:1623,770125,432,341115,405,0001,071,00020,480
7Oct 7, 2026 06:1623,773125,420,017115,407,0001,085,00020,480
8Oct 7, 2026 06:1623,827125,748,091115,671,0001,085,00020,480
9Oct 7, 2026 06:1623,829125,777,559115,705,0001,061,00020,480