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 23:37highload-churnerhighload-churnerScore: 50,437Success
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 01:2150,350255,703,377245,711,0001,006,00020,480
2Oct 10, 2026 01:2150,378255,829,311244,834,0002,022,00020,480
3Oct 10, 2026 01:2150,407255,969,221244,793,0002,205,00020,480
4Oct 10, 2026 01:2150,416256,003,131244,850,0002,193,00020,480
5Oct 10, 2026 01:2150,437256,142,859244,916,0002,226,00020,480
6Oct 10, 2026 01:2150,440256,122,376244,920,0002,240,00020,480
7Oct 10, 2026 01:2150,516256,514,418245,517,0002,012,00020,480
8Oct 10, 2026 01:2150,519256,975,347245,535,0002,011,00020,480
9Oct 10, 2026 01:2150,532256,564,642245,378,0002,230,00020,480