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 21:41anboto1anboto1Score: 57,597Success
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 21:4257,555291,071,445280,842,0001,181,0002,113,536
2Aug 3, 2026 21:4257,578290,681,640281,130,0001,003,0002,113,536
3Aug 3, 2026 21:4257,579290,548,122281,025,0001,113,0002,113,536
4Aug 3, 2026 21:4257,592291,229,757281,102,0001,099,0002,113,536
5Aug 3, 2026 21:4257,597290,719,799281,138,0001,091,0002,113,536
6Aug 3, 2026 21:4257,626290,824,505281,271,0001,100,0002,113,536
7Aug 3, 2026 21:4257,793293,720,381282,098,0001,089,0002,113,536
8Aug 3, 2026 21:4258,540295,961,465285,675,0001,171,0002,113,536
9Aug 3, 2026 21:4258,772297,020,128286,865,0001,120,0002,113,536