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 13, 2026 18:41Karthik ReddyKarthik ReddyScore: 23,263Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 18:4223,1826,122,666,217112,507,0001,089,00020,480
2Oct 13, 2026 18:4223,1936,122,743,801112,542,0001,108,00020,480
3Oct 13, 2026 18:4223,2196,122,963,849112,677,0001,097,00020,480
4Oct 13, 2026 18:4223,2626,123,184,383112,885,0001,103,00020,480
5Oct 13, 2026 18:4223,2636,123,170,309112,879,0001,113,00020,480
6Oct 13, 2026 18:4223,2746,123,253,661112,972,0001,075,00020,480
7Oct 13, 2026 18:4223,2886,123,283,038113,012,0001,104,00020,480
8Oct 13, 2026 18:4223,2926,123,248,733112,976,0001,157,00020,480
9Oct 13, 2026 18:4223,3656,123,677,746113,384,0001,109,00020,480