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:38Rajarshi BasuRajarshi BasuScore: 5,123Success
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:385,084190,002,369160,797,0006,991,0002,465,792
2Dec 20, 2025 09:395,098192,048,437160,235,0008,011,0002,379,776
3Dec 20, 2025 09:395,100193,956,731162,297,0006,011,0002,514,944
4Dec 20, 2025 09:395,123191,799,047164,052,0005,001,0002,510,848
5Dec 20, 2025 09:385,133203,291,448164,365,0005,011,0002,514,944
6Dec 20, 2025 09:385,289200,949,475169,552,0004,986,0002,396,160