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 20:27anboto1anboto1Score: 57,618Success
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 20:2957,546290,985,044280,803,0001,177,0002,113,536
2Aug 3, 2026 20:2957,571291,114,782280,976,0001,125,0002,113,536
3Aug 3, 2026 20:2957,592290,626,666281,089,0001,112,0002,113,536
4Aug 3, 2026 20:2957,595290,652,451281,104,0001,115,0002,113,536
5Aug 3, 2026 20:2957,618291,408,889281,216,0001,114,0002,113,536
6Aug 3, 2026 20:2957,632290,919,550281,166,0001,234,0002,113,536
7Aug 3, 2026 20:2958,035293,467,083283,181,0001,191,0002,113,536
8Aug 3, 2026 20:2958,230293,877,764284,220,0001,110,0002,113,536
9Aug 3, 2026 20:2959,132298,278,579288,630,0001,120,0002,113,536