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 00:01highload-churnerhighload-churnerScore: 48,334Success
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:3848,283245,908,083235,526,0001,065,00020,480
2Oct 10, 2026 01:3848,294245,594,925235,490,0001,154,00020,480
3Oct 10, 2026 01:3848,305246,021,101235,498,0001,200,00020,480
4Oct 10, 2026 01:3848,314245,745,939235,586,0001,154,00020,480
5Oct 10, 2026 01:3848,334245,997,137235,666,0001,174,00020,480
6Oct 10, 2026 01:3848,335245,861,868235,841,0001,002,00020,480
7Oct 10, 2026 01:3848,389246,142,400236,107,0001,002,00020,480
8Oct 10, 2026 01:3851,034259,066,930249,021,0001,048,00020,480
9Oct 10, 2026 01:3851,595261,757,640251,673,0001,146,00020,480