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 15:43Josu San MartinJosu San MartinScore: 29,510Success
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 15:4429,451153,353,489143,060,0001,250,0002,113,536
2Aug 3, 2026 15:4429,465154,854,743143,124,0001,257,0002,113,536
3Aug 3, 2026 15:4429,469152,594,039143,146,0001,254,0002,113,536
4Aug 3, 2026 15:4429,488153,567,226143,240,0001,256,0002,113,536
5Aug 3, 2026 15:4429,510154,648,668143,554,0001,049,0002,113,536
6Aug 3, 2026 15:4429,514153,630,256143,595,0001,027,0002,113,536
7Aug 3, 2026 15:4429,515153,297,805143,618,0001,010,0002,113,536
8Aug 3, 2026 15:4429,516153,666,287143,361,0001,269,0002,113,536
9Aug 3, 2026 15:4429,560153,833,948143,591,0001,256,0002,113,536