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 11, 2026 14:01highload-churnerhighload-churnerScore: 25,913Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2026 14:0225,793135,439,537125,295,0001,091,0002,113,536
2Oct 11, 2026 14:0225,824135,566,584125,446,0001,094,0002,113,536
3Oct 11, 2026 14:0225,871135,798,573125,583,0001,187,0002,113,536
4Oct 11, 2026 14:0225,876137,152,779125,614,0001,181,0002,113,536
5Oct 11, 2026 14:0225,913135,989,606125,940,0001,034,0002,113,536
6Oct 11, 2026 14:0225,950136,250,817126,148,0001,007,0002,113,536
7Oct 11, 2026 14:0226,124137,054,070126,990,0001,021,0002,113,536
8Oct 11, 2026 14:0226,156137,124,518127,149,0001,018,0002,113,536
9Oct 11, 2026 14:0226,432138,522,004128,424,0001,094,0002,113,536