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 13, 2026 00:26highload-churnerhighload-churnerScore: 23,518Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 00:2623,482124,186,046113,980,0001,084,00020,480
2Oct 13, 2026 00:2623,487124,071,759113,966,0001,125,00020,480
3Oct 13, 2026 00:2623,500131,857,905114,015,0001,139,00020,480
4Oct 13, 2026 00:2623,501124,076,753114,071,0001,087,00020,480
5Oct 13, 2026 00:2623,518124,226,750114,199,0001,043,00020,480
6Oct 13, 2026 00:2623,531124,353,689114,289,0001,017,00020,480
7Oct 13, 2026 00:2623,534124,368,143114,261,0001,059,00020,480
8Oct 13, 2026 00:2623,541124,465,071114,266,0001,087,00020,480
9Oct 13, 2026 00:2623,572124,457,025114,501,0001,004,00020,480