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 08:04highload-churnerhighload-churnerScore: 63,284Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 08:5563,251318,909,483308,876,0001,057,00020,480
2Oct 9, 2026 08:5563,267319,042,532308,964,0001,048,00020,480
3Oct 9, 2026 08:5563,269318,938,453308,965,0001,056,00020,480
4Oct 9, 2026 08:5563,277319,003,184308,998,0001,061,00020,480
5Oct 9, 2026 08:5563,284319,197,206308,969,0001,126,00020,480
6Oct 9, 2026 08:5563,292320,615,860308,992,0001,141,00020,480
7Oct 9, 2026 08:5563,292319,091,498309,056,0001,078,00020,480
8Oct 9, 2026 08:5567,402339,211,630329,211,0001,063,00020,480
9Oct 9, 2026 08:5567,412339,247,805329,264,0001,056,00020,480