Unique strings Sergey Svistunov

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listDec 22, 2025 16:47zielajzielajScore: 5,238Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 16:475,203193,784,132161,708,0009,981,0002,420,736
2Dec 22, 2025 16:475,216193,962,831158,127,00014,011,0002,408,448
3Dec 22, 2025 16:475,236193,696,832153,802,00018,975,0002,478,080
4Dec 22, 2025 16:475,236195,962,302163,802,0008,989,0002,441,216
5Dec 22, 2025 16:475,238197,353,054152,884,00019,984,0002,457,600
6Dec 22, 2025 16:475,239196,185,237152,907,00019,987,0002,379,776
7Dec 22, 2025 16:475,266198,730,899161,790,00011,984,0002,293,760
8Dec 22, 2025 16:475,290198,792,409157,626,00016,959,0002,486,272
9Dec 22, 2025 16:475,302199,586,517162,954,00011,996,0002,293,760