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 31, 2026 18:05anboto1anboto1Score: 147,276Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 18:05147,097730,775,397719,708,0001,071,0002,113,536
2Jul 31, 2026 18:05147,127730,874,481719,855,0001,072,0002,113,536
3Jul 31, 2026 18:05147,232731,445,596720,360,0001,077,0002,113,536
4Jul 31, 2026 18:05147,246731,388,860720,440,0001,070,0002,113,536
5Jul 31, 2026 18:05147,276731,580,751720,596,0001,059,0002,113,536
6Jul 31, 2026 18:05147,287731,623,316720,634,0001,077,0002,113,536
7Jul 31, 2026 18:05147,287731,755,243720,637,0001,074,0002,113,536
8Jul 31, 2026 18:05147,646733,384,740722,385,0001,081,0002,113,536
9Jul 31, 2026 18:05147,675733,588,854722,528,0001,081,0002,113,536