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 14:30Kevin HeaveyKevin HeaveyScore: 64,920Success
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:1464,420325,695,640307,406,0008,253,00020,480
2Jul 27, 2026 15:1464,534326,263,584307,878,0008,339,00020,480
3Jul 27, 2026 15:1464,638329,318,680307,591,0009,140,00020,480
4Jul 27, 2026 15:1464,806328,334,446307,255,00010,296,00020,480
5Jul 27, 2026 15:1464,920328,242,561307,474,00010,638,0002,113,536
6Jul 27, 2026 15:1465,050329,420,248308,346,00010,400,00020,480
7Jul 27, 2026 15:1465,170330,178,677309,516,0009,821,0002,113,536
8Jul 27, 2026 15:1465,308329,978,216311,616,0008,395,00020,480
9Jul 27, 2026 15:1465,401330,425,093307,343,00013,126,00020,480