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 21:16highload-churnerhighload-churnerScore: 56,383Success
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 21:2155,678281,738,488249,354,00023,472,00020,480
2Oct 9, 2026 21:2155,854282,703,986249,783,00023,906,00020,480
3Oct 9, 2026 21:2155,934283,193,274249,799,00024,280,00020,480
4Oct 9, 2026 21:2156,311285,130,075251,036,00024,889,00020,480
5Oct 9, 2026 21:2156,383285,250,583249,482,00026,797,00020,480
6Oct 9, 2026 21:2156,627286,549,060252,852,00024,624,00020,480
7Oct 9, 2026 21:2156,918287,869,218249,127,00029,775,00020,480
8Oct 9, 2026 21:2157,040288,342,660248,787,00030,711,00020,480
9Oct 9, 2026 21:2157,375290,198,095249,005,00032,133,00020,480