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 04:52highload-churnerhighload-churnerScore: 37,728Success
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 04:5237,683194,276,949183,151,0001,498,00020,480
2Oct 10, 2026 04:5237,704193,793,105181,949,0002,805,00020,480
3Oct 10, 2026 04:5237,721193,807,358182,973,0001,860,00020,480
4Oct 10, 2026 04:5237,727193,899,464181,984,0002,880,00020,480
5Oct 10, 2026 04:5237,728193,915,344182,030,0002,841,00020,480
6Oct 10, 2026 04:5237,861194,586,444183,813,0001,707,00020,480
7Oct 10, 2026 04:5237,900194,888,183183,909,0001,805,00020,480
8Oct 10, 2026 04:5237,930194,906,508182,970,0002,890,00020,480
9Oct 10, 2026 04:5237,966195,425,775184,176,0001,861,00020,480