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 9, 2026 07:31highload-churnerhighload-churnerScore: 81,733Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 07:4277,722390,338,270379,749,0001,090,00020,480
2Oct 9, 2026 07:4278,642395,947,828384,191,0001,157,00020,480
3Oct 9, 2026 07:4281,721409,544,848399,303,0001,133,00020,480
4Oct 9, 2026 07:4281,723409,385,467399,371,0001,076,00020,480
5Oct 9, 2026 07:4281,733409,506,749399,395,0001,101,00020,480
6Oct 9, 2026 07:4281,734409,565,364399,361,0001,138,00020,480
7Oct 9, 2026 07:4281,748409,670,807399,504,0001,064,00020,480
8Oct 9, 2026 07:4281,756409,646,596399,533,0001,074,00020,480
9Oct 9, 2026 07:4281,826411,026,751399,832,0001,119,00020,480