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:50anboto1anboto1Score: 62,572Success
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:5261,963312,990,288302,499,0001,123,0002,113,536
2Aug 3, 2026 20:5261,967312,769,584302,527,0001,112,0002,113,536
3Aug 3, 2026 20:5262,042313,088,794302,910,0001,096,0002,113,536
4Aug 3, 2026 20:5262,069312,656,393302,861,0001,278,0002,113,536
5Aug 3, 2026 20:5262,572315,624,418305,456,0001,149,0002,113,536
6Aug 3, 2026 20:5262,662315,547,718305,951,0001,096,0002,113,536
7Aug 3, 2026 20:5262,901317,339,588307,118,0001,098,0002,113,536
8Aug 3, 2026 20:5263,272319,134,779308,927,0001,107,0002,113,536
9Aug 3, 2026 20:5263,363319,024,968309,301,0001,180,0002,113,536