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 listMar 8, 2026 16:09SneedSneedScore: 1,104,868Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 8, 2026 16:091,104,3385,443,226,0035,409,259,0001,998,0002,277,376
2Mar 8, 2026 16:091,104,4135,448,148,2595,409,628,0001,998,0002,277,376
3Mar 8, 2026 16:091,104,4565,445,089,9245,408,837,0002,998,0002,277,376
4Mar 8, 2026 16:091,104,5965,445,478,3475,410,522,0001,999,0002,277,376
5Mar 8, 2026 16:091,104,8685,444,464,3275,412,852,000999,0002,265,088
6Mar 8, 2026 16:091,104,9295,440,918,7455,414,150,00002,527,232
7Mar 8, 2026 16:091,105,0015,442,112,5655,412,508,0001,999,0002,285,568
8Mar 8, 2026 16:091,105,0035,446,654,4055,411,518,0002,998,0002,531,328
9Mar 8, 2026 16:091,105,0305,444,458,1545,411,648,0002,998,0002,277,376