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:12anboto1anboto1Score: 59,651Success
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:1259,581300,249,030290,793,0001,155,0002,113,536
2Aug 3, 2026 20:1259,621301,315,971291,051,0001,092,0002,113,536
3Aug 3, 2026 20:1259,630301,279,804291,086,0001,102,0002,113,536
4Aug 3, 2026 20:1259,640301,298,846291,125,0001,113,0002,113,536
5Aug 3, 2026 20:1259,651300,730,211291,204,0001,089,0002,113,536
6Aug 3, 2026 20:1259,660301,568,677291,245,0001,090,0002,113,536
7Aug 3, 2026 20:1259,685301,597,041291,329,0001,131,0002,113,536
8Aug 3, 2026 20:1259,832302,238,058292,081,0001,099,0002,113,536
9Aug 3, 2026 20:1260,959307,129,698297,618,0001,085,0002,113,536