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 1, 2026 01:06anboto1anboto1Score: 119,961Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 01:07118,881592,817,245581,287,0001,234,0002,113,536
2Aug 1, 2026 01:07118,885593,273,847581,296,0001,242,0002,113,536
3Aug 1, 2026 01:07119,059593,545,558582,178,0001,212,0002,113,536
4Aug 1, 2026 01:07119,110593,759,238582,428,0001,214,0002,113,536
5Aug 1, 2026 01:07119,961598,014,348586,558,0001,254,0002,113,536
6Aug 1, 2026 01:07120,045598,418,061587,018,0001,203,0002,113,536
7Aug 1, 2026 01:07120,910604,244,037591,206,0001,254,0002,113,536
8Aug 1, 2026 01:07121,015603,259,552591,752,0001,223,0002,113,536
9Aug 1, 2026 01:07121,508605,698,597594,162,0001,228,0002,113,536