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,612Success
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:4860,513305,470,815295,441,0001,073,00020,480
2Oct 9, 2026 09:4860,516305,469,677295,394,0001,137,00020,480
3Oct 9, 2026 09:4860,519305,503,534295,470,0001,074,00020,480
4Oct 9, 2026 09:4860,573305,728,623295,681,0001,131,00020,480
5Oct 9, 2026 09:4860,612305,955,240295,919,0001,084,00020,480
6Oct 9, 2026 09:4860,613305,961,422295,949,0001,059,00020,480
7Oct 9, 2026 09:4860,691306,360,751296,322,0001,064,00020,480
8Oct 9, 2026 09:4860,693306,390,107296,328,0001,071,00020,480
9Oct 9, 2026 09:4860,736306,548,305296,563,0001,046,00020,480