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 20:01highload-churnerhighload-churnerScore: 53,865Success
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 20:0253,786272,536,796262,508,0001,047,00020,480
2Oct 9, 2026 20:0253,839272,772,361262,765,0001,047,00020,480
3Oct 9, 2026 20:0253,846272,896,645262,766,0001,080,00020,480
4Oct 9, 2026 20:0253,851272,685,486262,810,0001,060,00020,480
5Oct 9, 2026 20:0253,865272,776,756262,893,0001,048,00020,480
6Oct 9, 2026 20:0253,865272,852,484262,882,0001,061,00020,480
7Oct 9, 2026 20:0253,899273,248,703263,050,0001,058,00020,480
8Oct 9, 2026 20:0253,917273,125,162263,124,0001,073,00020,480
9Oct 9, 2026 20:0253,943273,301,214263,320,0001,001,00020,480