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 4, 2026 03:41zielajzielajScore: 24,426Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 11:47Victor Mercklé10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 03:4224,383127,472,543117,410,0002,069,0002,121,728stderr
2Jul 4, 2026 03:4224,385127,509,127117,381,0002,110,0002,121,728stderr
3Jul 4, 2026 03:4224,398127,790,057117,484,0002,069,0002,121,728stderr
4Jul 4, 2026 03:4224,408128,001,806117,529,0002,072,0002,121,728stderr
5Jul 4, 2026 03:4224,426127,650,203117,623,0002,067,0002,121,728stderr
6Jul 4, 2026 03:4224,436127,725,048117,543,0002,196,0002,121,728stderr
7Jul 4, 2026 03:4224,446127,726,115117,674,0002,113,0002,121,728stderr
8Jul 4, 2026 03:4225,152131,430,044121,235,0002,010,0002,121,728stderr
9Jul 4, 2026 03:4226,167136,466,257126,208,0002,013,0002,121,728stderr