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 17:58anboto1anboto1Score: 188,140Success
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 17:59187,870930,505,048919,498,0001,069,0002,113,536
2Jul 31, 2026 17:59187,922930,751,324919,773,0001,049,0002,113,536
3Jul 31, 2026 17:59187,946930,984,335919,853,0001,085,0002,113,536
4Jul 31, 2026 17:59188,117931,680,837920,728,0001,049,0002,113,536
5Jul 31, 2026 17:59188,140932,416,908920,825,0001,065,0002,113,536
6Jul 31, 2026 17:59188,145931,907,688920,864,0001,049,0002,113,536
7Jul 31, 2026 17:59188,255932,526,940921,393,0001,060,0002,113,536
8Jul 31, 2026 17:59188,688934,694,893923,519,0001,054,0002,113,536
9Jul 31, 2026 17:59188,976935,952,468924,928,0001,059,0002,113,536