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 20:04Josu San MartinJosu San MartinScore: 48,205Success
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 20:0548,162246,165,456234,865,0001,129,0002,113,536
2Jul 31, 2026 20:0548,177246,997,558234,945,0001,126,0002,113,536
3Jul 31, 2026 20:0548,195246,256,636235,033,0001,123,0002,113,536
4Jul 31, 2026 20:0548,198246,999,135234,933,0001,240,0002,113,536
5Jul 31, 2026 20:0548,205247,118,720235,080,0001,126,0002,113,536
6Jul 31, 2026 20:0548,485247,921,382236,466,0001,114,0002,113,536
7Jul 31, 2026 20:0548,505247,806,512236,553,0001,124,0002,113,536
8Jul 31, 2026 20:0548,538248,827,700236,706,0001,134,0002,113,536
9Jul 31, 2026 20:0548,848249,475,355238,247,0001,113,0002,113,536