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 listJan 8, 2026 19:11Josu San MartinJosu San MartinScore: 17,451Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 19:1115,564536,423,750381,709,000131,899,0002,293,760
2Jan 8, 2026 19:1115,672542,271,163382,394,000134,786,0002,301,952
3Jan 8, 2026 19:1116,574572,976,839407,224,000139,733,0002,310,144
4Jan 8, 2026 19:1117,451604,347,616440,920,000134,975,0002,297,856
5Jan 8, 2026 19:1118,595640,440,718482,702,000130,919,0002,297,856
6Jan 8, 2026 19:1118,883648,235,673490,324,000132,817,0002,506,752