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:20anboto1anboto1Score: 58,036Success
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:2157,503290,883,628280,672,0001,094,0002,113,536
2Aug 3, 2026 21:2157,529290,330,340280,801,0001,092,0002,113,536
3Aug 3, 2026 21:2157,729291,351,253281,702,0001,174,0002,113,536
4Aug 3, 2026 21:2157,954292,434,580282,890,0001,086,0002,113,536
5Aug 3, 2026 21:2158,036292,814,387283,153,0001,224,0002,113,536
6Aug 3, 2026 21:2158,232295,206,542284,210,0001,128,0002,113,536
7Aug 3, 2026 21:2158,663296,922,911286,352,0001,101,0002,113,536
8Aug 3, 2026 21:2159,050298,379,559288,243,0001,102,0002,113,536
9Aug 3, 2026 21:2159,140298,410,734288,630,0001,160,0002,113,536