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 12, 2026 05:02highload-churnerhighload-churnerScore: 24,988Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 05:0324,913131,081,050120,965,0001,110,0002,113,536
2Oct 12, 2026 05:0324,916131,025,789120,971,0001,118,0002,113,536
3Oct 12, 2026 05:0324,917132,497,816120,930,0001,165,0002,113,536
4Oct 12, 2026 05:0324,958131,271,470121,060,0001,236,0002,113,536
5Oct 12, 2026 05:0324,988132,133,706121,345,0001,099,0002,113,536
6Oct 12, 2026 05:0325,003131,528,173121,473,0001,045,0002,113,536
7Oct 12, 2026 05:0325,173132,403,120122,243,0001,107,0002,113,536
8Oct 12, 2026 05:0325,476133,905,144123,734,0001,103,0002,113,536
9Oct 12, 2026 05:0325,598134,467,984124,329,0001,103,0002,113,536