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 23:18highload-churnerhighload-churnerScore: 49,118Success
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 00:5949,056249,267,706239,371,0001,008,00020,480
2Oct 10, 2026 00:5949,075249,739,241239,464,0001,007,00020,480
3Oct 10, 2026 00:5949,076250,033,449239,467,0001,010,00020,480
4Oct 10, 2026 00:5949,115249,625,428239,658,0001,010,00020,480
5Oct 10, 2026 00:5949,118249,507,256239,673,0001,008,00020,480
6Oct 10, 2026 00:5949,121249,807,793239,687,0001,007,00020,480
7Oct 10, 2026 00:5949,124249,975,924239,701,0001,008,00020,480
8Oct 10, 2026 00:5949,132249,793,253239,741,0001,007,00020,480
9Oct 10, 2026 00:5949,866253,393,443242,312,0002,032,00020,480