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:26anboto1anboto1Score: 57,587Success
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:2657,520290,971,451280,709,0001,143,0002,113,536
2Aug 3, 2026 21:2657,523290,894,520280,779,0001,086,0002,113,536
3Aug 3, 2026 21:2657,544290,960,616280,882,0001,087,0002,113,536
4Aug 3, 2026 21:2657,558290,602,509280,886,0001,153,0002,113,536
5Aug 3, 2026 21:2657,587291,343,729281,092,0001,089,0002,113,536
6Aug 3, 2026 21:2657,623290,770,849281,171,0001,184,0002,113,536
7Aug 3, 2026 21:2657,630291,509,675281,196,0001,191,0002,113,536
8Aug 3, 2026 21:2657,744292,143,933281,834,0001,115,0002,113,536
9Aug 3, 2026 21:2657,754292,777,773281,856,0001,139,0002,113,536