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:05anboto1anboto1Score: 57,663Success
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:0757,586290,617,572281,057,0001,119,0002,113,536
2Aug 3, 2026 21:0757,635290,838,469281,290,0001,126,0002,113,536
3Aug 3, 2026 21:0757,650290,943,548281,300,0001,189,0002,113,536
4Aug 3, 2026 21:0757,653291,003,828281,326,0001,178,0002,113,536
5Aug 3, 2026 21:0757,663291,094,942281,273,0001,278,0002,113,536
6Aug 3, 2026 21:0757,861300,185,872282,339,0001,182,0002,113,536
7Aug 3, 2026 21:0758,253293,922,282284,334,0001,108,0002,113,536
8Aug 3, 2026 21:0758,285294,143,490284,480,0001,120,0002,113,536
9Aug 3, 2026 21:0759,103298,205,833288,495,0001,113,0002,113,536