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 10, 2026 00:02highload-churnerhighload-churnerScore: 49,662Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2026 01:3849,625252,231,495242,017,0001,146,00020,480
2Oct 10, 2026 01:3849,642252,190,769242,093,0001,155,00020,480
3Oct 10, 2026 01:3849,656252,351,401242,138,0001,180,00020,480
4Oct 10, 2026 01:3849,659252,338,673242,328,0001,003,00020,480
5Oct 10, 2026 01:3849,662252,880,824242,343,0001,002,00020,480
6Oct 10, 2026 01:3849,688252,500,178242,469,0001,004,00020,480
7Oct 10, 2026 01:3849,701252,476,103242,535,0001,003,00020,480
8Oct 10, 2026 01:3849,726252,639,864242,659,0001,002,00020,480
9Oct 10, 2026 01:3852,890268,280,274257,989,0001,176,00020,480