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 2, 2026 19:22Josu San MartinJosu San MartinScore: 32,290Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 19:2332,239168,635,246156,854,0001,119,0002,113,536
2Aug 2, 2026 19:2332,239168,862,294156,835,0001,138,0002,113,536
3Aug 2, 2026 19:2332,260168,187,812156,933,0001,143,0002,113,536
4Aug 2, 2026 19:2332,285168,233,444156,953,0001,248,0002,113,536
5Aug 2, 2026 19:2332,290168,303,201157,098,0001,127,0002,113,536
6Aug 2, 2026 19:2332,352169,129,684157,396,0001,133,0002,113,536
7Aug 2, 2026 19:2332,392168,770,134157,614,0001,109,0002,117,632
8Aug 2, 2026 19:2332,413169,660,894157,695,0001,132,0002,113,536
9Aug 2, 2026 19:2332,783170,702,571159,511,0001,127,0002,113,536