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:31Karthik ReddyKarthik ReddyScore: 24,558Success
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:3224,512129,022,342119,050,0001,062,00020,480
2Oct 12, 2026 20:3224,519129,993,105119,083,0001,064,00020,480
3Oct 12, 2026 20:3224,526129,154,112119,128,0001,054,00020,480
4Oct 12, 2026 20:3224,530129,145,689119,119,0001,080,00020,480
5Oct 12, 2026 20:3224,558129,329,387119,196,0001,143,00020,480
6Oct 12, 2026 20:3224,569129,386,558119,278,0001,111,00020,480
7Oct 12, 2026 20:3224,578129,350,794119,373,0001,063,00020,480
8Oct 12, 2026 20:3224,580129,454,755119,327,0001,119,00020,480
9Oct 12, 2026 20:3224,586129,401,689119,397,0001,075,00020,480