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:35anboto1anboto1Score: 170,356Success
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:36169,555840,914,369829,822,0001,002,0002,113,536
2Jul 31, 2026 17:36169,989843,025,739831,946,0001,002,0002,113,536
3Jul 31, 2026 17:36170,152843,660,451832,733,0001,013,0002,113,536
4Jul 31, 2026 17:36170,154843,761,076832,745,0001,011,0002,113,536
5Jul 31, 2026 17:36170,356844,670,972833,730,0001,018,0002,113,536
6Jul 31, 2026 17:36171,007847,851,307836,860,0001,079,0002,113,536
7Jul 31, 2026 17:36171,807851,719,647840,853,0001,004,0002,113,536
8Jul 31, 2026 17:36172,410854,729,477843,806,0001,007,0002,113,536
9Jul 31, 2026 17:36173,020858,961,215846,777,0001,021,0002,113,536