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 20, 2025 09:44Rajarshi BasuRajarshi BasuScore: 5,189Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 20, 2025 09:445,111199,715,691161,669,0006,985,0002,486,272
2Dec 20, 2025 09:445,152198,197,002162,030,0008,001,0002,392,064
3Dec 20, 2025 09:445,156192,479,261163,150,0007,006,0002,510,848
4Dec 20, 2025 09:445,179197,278,943163,898,0006,995,0002,322,432
5Dec 20, 2025 09:445,189198,246,355163,219,0008,010,0002,523,136
6Dec 20, 2025 09:445,267199,668,214169,818,0003,995,0002,510,848
7Dec 20, 2025 09:445,357203,308,416169,786,0006,991,0002,514,944
8Dec 20, 2025 09:445,400201,480,281174,181,0004,004,0002,449,408
9Dec 20, 2025 09:445,459207,312,096174,130,0006,004,0002,416,640