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:02highload-churnerhighload-churnerScore: 56,901Success
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:0456,761287,178,995277,069,0001,063,00020,480
2Oct 9, 2026 10:0456,838287,460,911277,383,0001,128,00020,480
3Oct 9, 2026 10:0456,892287,831,512277,769,0001,002,00020,480
4Oct 9, 2026 10:0456,899287,711,258277,734,0001,073,00020,480
5Oct 9, 2026 10:0456,901287,753,384277,765,0001,054,00020,480
6Oct 9, 2026 10:0456,924287,826,544277,870,0001,058,00020,480
7Oct 9, 2026 10:0456,940287,965,453277,951,0001,056,00020,480
8Oct 9, 2026 10:0456,942288,141,071277,907,0001,113,00020,480
9Oct 9, 2026 10:0456,954288,075,894277,960,0001,118,00020,480