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 07:33highload-churnerhighload-churnerScore: 95,960Success
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 07:4492,915464,232,593454,175,0001,113,00020,480
2Oct 9, 2026 07:4495,354476,209,804466,164,0001,072,00020,480
3Oct 9, 2026 07:4495,940479,042,525469,063,0001,044,00020,480
4Oct 9, 2026 07:4495,946481,254,660469,087,0001,052,00020,480
5Oct 9, 2026 07:4495,960479,146,766469,153,0001,054,00020,480
6Oct 9, 2026 07:4495,961479,082,088469,160,0001,050,00020,480
7Oct 9, 2026 07:4495,968479,293,284469,123,0001,122,00020,480
8Oct 9, 2026 07:4495,973479,298,843469,148,0001,123,00020,480
9Oct 9, 2026 07:4495,987479,313,334469,257,0001,080,00020,480