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 22:24highload-churnerhighload-churnerScore: 50,709Success
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 23:4250,665257,801,232247,194,0001,067,00020,480
2Oct 9, 2026 23:4250,667257,330,803247,213,0001,057,00020,480
3Oct 9, 2026 23:4250,684257,347,603247,281,0001,074,00020,480
4Oct 9, 2026 23:4250,701257,454,570247,303,0001,134,00020,480
5Oct 9, 2026 23:4250,709257,424,660247,421,0001,054,00020,480
6Oct 9, 2026 23:4250,723257,516,559247,481,0001,062,00020,480
7Oct 9, 2026 23:4250,733257,678,384247,530,0001,066,00020,480
8Oct 9, 2026 23:4250,748257,618,048247,612,0001,056,00020,480
9Oct 9, 2026 23:4255,007279,016,650268,478,0001,057,00020,480