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 22:22highload-churnerhighload-churnerScore: 51,546Success
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 23:3751,448261,111,270250,998,0001,101,00020,480
2Oct 9, 2026 23:3751,486261,343,134251,228,0001,057,00020,480
3Oct 9, 2026 23:3751,493261,346,930251,310,0001,007,00020,480
4Oct 9, 2026 23:3751,505261,354,707251,312,0001,067,00020,480
5Oct 9, 2026 23:3751,546261,670,909251,504,0001,072,00020,480
6Oct 9, 2026 23:3751,575261,817,453251,585,0001,134,00020,480
7Oct 9, 2026 23:3751,583261,787,689251,663,0001,098,00020,480
8Oct 9, 2026 23:3753,923273,408,587263,149,0001,077,00020,480
9Oct 9, 2026 23:3754,301275,140,857265,074,0001,002,00020,480