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 3, 2026 20:49anboto1anboto1Score: 61,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 3, 2026 20:5161,905311,879,528302,223,0001,115,0002,113,536
2Aug 3, 2026 20:5161,922311,932,094302,235,0001,185,0002,113,536
3Aug 3, 2026 20:5161,934312,660,515302,295,0001,185,0002,113,536
4Aug 3, 2026 20:5161,954312,011,915302,460,0001,115,0002,113,536
5Aug 3, 2026 20:5161,961312,191,500302,469,0001,141,0002,113,536
6Aug 3, 2026 20:5161,966312,148,862302,368,0001,268,0002,113,536
7Aug 3, 2026 20:5162,178313,185,655303,561,0001,116,0002,113,536
8Aug 3, 2026 20:5162,327313,787,982304,290,0001,115,0002,113,536
9Aug 3, 2026 20:5162,618315,290,599305,706,0001,123,0002,113,536