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:41highload-churnerhighload-churnerScore: 63,352Success
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:5163,269319,020,828308,959,0001,063,00020,480
2Oct 9, 2026 07:5163,275319,084,945308,984,0001,064,00020,480
3Oct 9, 2026 07:5163,282319,041,185309,006,0001,077,00020,480
4Oct 9, 2026 07:5163,295319,162,500309,013,0001,134,00020,480
5Oct 9, 2026 07:5163,352319,440,753309,273,0001,153,00020,480
6Oct 9, 2026 07:5163,403329,026,501309,656,0001,022,00020,480
7Oct 9, 2026 07:5167,399339,788,467329,194,0001,062,00020,480
8Oct 9, 2026 07:5167,419339,370,332329,270,0001,087,00020,480
9Oct 9, 2026 07:5167,462339,578,778329,421,0001,143,00020,480