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 12:37Kevin HeaveyKevin HeaveyScore: 55,091Success
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 12:4054,795278,486,026259,253,0009,245,0002,113,536
2Jul 27, 2026 12:4054,901279,093,057259,233,0009,783,00020,480
3Jul 27, 2026 12:4054,935279,346,760259,570,0009,615,0002,113,536
4Jul 27, 2026 12:4055,088279,944,325259,082,00010,850,00020,480
5Jul 27, 2026 12:4055,091280,015,954258,894,00011,053,00020,480
6Jul 27, 2026 12:4055,164280,333,577258,858,00011,446,0002,113,536
7Jul 27, 2026 12:4055,200280,836,834258,818,00011,664,0002,113,536
8Jul 27, 2026 12:4055,212280,559,402259,215,00011,326,0002,113,536
9Jul 27, 2026 12:4055,323281,106,678259,294,00011,792,0002,113,536