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:44highload-churnerhighload-churnerScore: 60,691Success
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 09:4760,560305,698,931295,687,0001,059,00020,480
2Oct 9, 2026 09:4760,589305,988,004295,759,0001,129,00020,480
3Oct 9, 2026 09:4760,631306,111,529295,920,0001,176,00020,480
4Oct 9, 2026 09:4760,658306,213,827296,174,0001,052,00020,480
5Oct 9, 2026 09:4760,691306,385,780296,284,0001,103,00020,480
6Oct 9, 2026 09:4760,704306,533,792296,374,0001,078,00020,480
7Oct 9, 2026 09:4760,713306,518,221296,408,0001,090,00020,480
8Oct 9, 2026 09:4760,869307,277,968297,197,0001,064,00020,480
9Oct 9, 2026 09:4760,972307,734,102297,708,0001,058,00020,480