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:33highload-churnerhighload-churnerScore: 56,281Success
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:3356,195284,383,104274,295,0001,065,00020,480
2Oct 9, 2026 10:3356,197284,326,134274,308,0001,062,00020,480
3Oct 9, 2026 10:3356,198284,378,262274,317,0001,056,00020,480
4Oct 9, 2026 10:3356,231284,452,493274,433,0001,100,00020,480
5Oct 9, 2026 10:3356,281284,796,829274,716,0001,064,00020,480
6Oct 9, 2026 10:3356,320284,851,637274,904,0001,067,00020,480
7Oct 9, 2026 10:3356,376285,177,342275,190,0001,053,00020,480
8Oct 9, 2026 10:3356,517285,943,189275,871,0001,067,00020,480
9Oct 9, 2026 10:3356,593287,735,668276,232,0001,075,00020,480