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:26highload-churnerhighload-churnerScore: 23,452Success
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:2623,445123,918,228113,796,0001,089,00020,480
2Oct 13, 2026 02:2623,445123,980,535113,815,0001,067,00020,480
3Oct 13, 2026 02:2623,447123,901,082113,833,0001,061,00020,480
4Oct 13, 2026 02:2623,449123,856,798113,825,0001,079,00020,480
5Oct 13, 2026 02:2623,452123,939,358113,849,0001,069,00020,480
6Oct 13, 2026 02:2623,459123,937,609113,878,0001,074,00020,480
7Oct 13, 2026 02:2623,462123,981,874113,892,0001,076,00020,480
8Oct 13, 2026 02:2623,471124,001,127113,948,0001,063,00020,480
9Oct 13, 2026 02:2623,476124,042,106113,973,0001,062,00020,480