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 1, 2026 21:16CodeReclaimersCodeReclaimersScore: 70,121Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 21:1770,071353,487,510342,245,0001,106,0002,113,536
2Aug 1, 2026 21:1770,097354,554,140342,329,0001,148,0002,113,536
3Aug 1, 2026 21:1770,098353,630,058342,370,0001,113,0002,113,536
4Aug 1, 2026 21:1770,110353,759,183342,435,0001,107,0002,113,536
5Aug 1, 2026 21:1770,121353,768,328342,466,0001,128,0002,113,536
6Aug 1, 2026 21:1770,130353,906,927342,549,0001,092,0002,113,536
7Aug 1, 2026 21:1770,139354,616,722342,571,0001,114,0002,113,536
8Aug 1, 2026 21:1770,152353,877,052342,629,0001,120,0002,113,536
9Aug 1, 2026 21:1770,997358,079,795346,765,0001,122,0002,113,536