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 31, 2025 03:22Rajarshi BasuRajarshi BasuScore: 4,914Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2025 03:234,884184,567,401158,176,0003,003,0002,285,568
2Dec 31, 2025 03:234,892187,907,063159,436,0002,005,0002,285,568
3Dec 31, 2025 03:224,906191,142,070159,905,0001,998,0002,383,872
4Dec 31, 2025 03:234,909186,035,168159,004,0003,000,0002,285,568
5Dec 31, 2025 03:234,914193,365,026159,151,0003,002,0002,379,776
6Dec 31, 2025 03:224,915187,353,047160,194,0002,002,0002,519,040
7Dec 31, 2025 03:224,958193,378,675161,609,0001,995,0002,285,568
8Dec 31, 2025 03:234,959190,014,951161,655,0001,995,0002,285,568
9Dec 31, 2025 03:234,976189,128,598162,222,0002,002,0002,285,568