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 listJul 27, 2026 15:40Kevin HeaveyKevin HeaveyScore: 62,370Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 15:4162,238315,094,611303,438,0001,532,00020,480
2Jul 27, 2026 15:4162,281315,277,838303,502,0001,678,00020,480
3Jul 27, 2026 15:4162,285315,283,507303,773,0001,424,0002,113,536
4Jul 27, 2026 15:4162,343315,493,588303,841,0001,640,00020,480
5Jul 27, 2026 15:4162,370315,676,695303,962,0001,653,00020,480
6Jul 27, 2026 15:4162,640317,009,063305,406,0001,533,00020,480
7Jul 27, 2026 15:4162,644316,985,817305,210,0001,747,0002,113,536
8Jul 27, 2026 15:4162,677317,215,002305,468,0001,653,0002,113,536
9Jul 27, 2026 15:4162,717317,347,756305,562,0001,752,0002,113,536