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 02:39highload-churnerhighload-churnerScore: 23,052Success
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 02:4023,041121,935,300111,832,0001,069,00020,480
2Oct 13, 2026 02:4023,046121,903,892111,850,0001,079,00020,480
3Oct 13, 2026 02:4023,048123,332,997111,863,0001,073,00020,480
4Oct 13, 2026 02:4023,051122,026,621111,884,0001,069,00020,480
5Oct 13, 2026 02:4023,052121,985,199111,879,0001,076,00020,480
6Oct 13, 2026 02:4023,085122,142,908112,048,0001,073,00020,480
7Oct 13, 2026 02:4023,091122,140,568112,086,0001,060,00020,480
8Oct 13, 2026 02:4023,094122,153,022112,081,0001,083,00020,480
9Oct 13, 2026 02:4023,224123,131,834112,570,0001,232,00020,480