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 4, 2026 07:05Josu San MartinJosu San MartinScore: 26,643Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 07:0626,581138,434,054129,244,0001,005,0002,113,536
2Aug 4, 2026 07:0626,633139,025,231129,245,0001,260,0002,113,536
3Aug 4, 2026 07:0626,639138,988,339129,279,0001,253,0002,113,536
4Aug 4, 2026 07:0626,639138,967,309129,267,0001,265,0002,113,536
5Aug 4, 2026 07:0626,643138,728,038129,277,0001,276,0002,113,536
6Aug 4, 2026 07:0626,648139,022,795129,306,0001,271,0002,113,536
7Aug 4, 2026 07:0626,675139,154,949129,673,0001,037,0002,113,536
8Aug 4, 2026 07:0626,703139,355,596129,580,0001,268,0002,113,536
9Aug 4, 2026 07:0627,501143,171,928133,658,0001,097,0002,113,536