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 22:37anboto1anboto1Score: 123,634Success
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 22:40122,303609,549,982597,901,0001,384,0002,113,536
2Jul 31, 2026 22:40122,379609,944,043598,444,0001,215,0002,113,536
3Jul 31, 2026 22:40122,419610,886,016598,604,0001,252,0002,113,536
4Jul 31, 2026 22:40123,629615,977,071604,574,0001,212,0002,113,536
5Jul 31, 2026 22:40123,634616,045,278604,579,0001,231,0002,113,536
6Jul 31, 2026 22:40123,707616,442,816604,934,0001,231,0002,113,536
7Jul 31, 2026 22:40124,091618,210,919606,842,0001,205,0002,113,536
8Jul 31, 2026 22:40124,147618,548,015607,104,0001,220,0002,113,536
9Jul 31, 2026 22:40124,783621,661,484610,221,0001,220,0002,113,536