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 22:12highload-churnerhighload-churnerScore: 49,870Success
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 23:1649,853253,258,166243,142,0001,139,00020,480
2Oct 9, 2026 23:1649,855253,296,782243,234,0001,057,00020,480
3Oct 9, 2026 23:1649,868253,351,661243,287,0001,067,00020,480
4Oct 9, 2026 23:1649,869253,356,138243,281,0001,080,00020,480
5Oct 9, 2026 23:1649,870253,318,271243,261,0001,103,00020,480
6Oct 9, 2026 23:1649,906253,582,047243,420,0001,120,00020,480
7Oct 9, 2026 23:1649,907253,529,090243,528,0001,021,00020,480
8Oct 9, 2026 23:1649,996254,620,085243,974,0001,007,00020,480
9Oct 9, 2026 23:1652,436265,966,941255,862,0001,079,00020,480