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 07:27highload-churnerhighload-churnerScore: 22,869Success
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 07:2922,857121,061,499110,941,0001,060,00020,480
2Oct 13, 2026 07:2922,858121,035,906110,941,0001,064,00020,480
3Oct 13, 2026 07:2922,864120,978,222110,980,0001,058,00020,480
4Oct 13, 2026 07:2922,866121,010,377110,987,0001,057,00020,480
5Oct 13, 2026 07:2922,869121,112,737110,987,0001,074,00020,480
6Oct 13, 2026 07:2922,870121,135,174110,964,0001,100,00020,480
7Oct 13, 2026 07:2922,879121,091,730111,035,0001,075,00020,480
8Oct 13, 2026 07:2922,888121,237,105110,998,0001,156,00020,480
9Oct 13, 2026 07:2922,914121,243,639111,219,0001,063,00020,480