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 listAug 4, 2026 12:25Josu San MartinJosu San MartinScore: 25,458Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 12:2625,411133,597,525123,265,0001,250,0002,113,536
2Aug 4, 2026 12:2625,446133,088,347123,441,0001,249,0002,113,536
3Aug 4, 2026 12:2625,455133,140,812123,469,0001,264,0002,113,536
4Aug 4, 2026 12:2625,456133,742,011123,465,0001,272,0002,113,536
5Aug 4, 2026 12:2625,458133,308,122123,717,0001,031,0002,113,536
6Aug 4, 2026 12:2625,458133,082,347123,489,0001,256,0002,113,536
7Aug 4, 2026 12:2625,460134,478,653123,744,0001,012,0002,113,536
8Aug 4, 2026 12:2625,476133,346,035123,553,0001,280,0002,113,536
9Aug 4, 2026 12:2625,697134,913,922124,915,0001,003,0002,113,536