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 10, 2026 01:30highload-churnerhighload-churnerScore: 49,715Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2026 02:1649,653252,309,551239,433,0003,870,00020,480
2Oct 10, 2026 02:1649,671252,640,579239,602,0003,787,00020,480
3Oct 10, 2026 02:1649,673252,505,974239,573,0003,826,00020,480
4Oct 10, 2026 02:1649,701252,669,311239,550,0003,986,00020,480
5Oct 10, 2026 02:1649,715252,813,892239,437,0004,171,00020,480
6Oct 10, 2026 02:1649,754252,856,298239,942,0003,854,00020,480
7Oct 10, 2026 02:1649,802253,035,020240,039,0003,991,00020,480
8Oct 10, 2026 02:1650,240255,248,179242,392,0003,786,00020,480
9Oct 10, 2026 02:1651,835263,019,327250,159,0003,835,00020,480