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:34highload-churnerhighload-churnerScore: 90,438Success
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:4787,860439,479,313429,390,0001,127,00020,480
2Oct 9, 2026 07:4788,024440,382,150430,249,0001,070,00020,480
3Oct 9, 2026 07:4788,112440,788,276430,673,0001,077,00020,480
4Oct 9, 2026 07:4788,694443,618,336433,494,0001,107,00020,480
5Oct 9, 2026 07:4790,438452,142,424442,034,0001,117,00020,480
6Oct 9, 2026 07:4790,458452,301,538442,159,0001,089,00020,480
7Oct 9, 2026 07:4790,458452,343,018442,108,0001,140,00020,480
8Oct 9, 2026 07:4790,641462,041,380443,061,0001,081,00020,480
9Oct 9, 2026 07:4790,823463,855,230443,948,0001,085,00020,480