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 10:07highload-churnerhighload-churnerScore: 57,228Success
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 10:1457,024288,392,062278,364,0001,058,00020,480
2Oct 9, 2026 10:1457,131288,934,351278,886,0001,058,00020,480
3Oct 9, 2026 10:1457,134289,143,643278,833,0001,128,00020,480
4Oct 9, 2026 10:1457,211289,333,556279,277,0001,059,00020,480
5Oct 9, 2026 10:1457,228289,492,951279,367,0001,051,00020,480
6Oct 9, 2026 10:1457,294289,658,368279,674,0001,070,00020,480
7Oct 9, 2026 10:1457,308289,797,670279,761,0001,051,00020,480
8Oct 9, 2026 10:1457,318289,866,386279,788,0001,071,00020,480
9Oct 9, 2026 10:1458,902297,676,246287,544,0001,076,00020,480