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 17, 2025 18:13Rajarshi BasuRajarshi BasuScore: 12,244Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 17, 2025 18:1011,953422,978,125383,475,00010,984,0002,269,184
2Dec 17, 2025 18:1011,974423,369,302390,156,0005,002,0002,433,024
3Dec 17, 2025 18:1012,217433,854,817395,163,0008,003,0002,506,752
4Dec 17, 2025 18:1312,244434,181,051401,041,0003,000,0002,269,184
5Dec 17, 2025 18:1312,678444,848,827412,379,0005,990,0002,531,328
6Dec 17, 2025 18:1312,815450,496,073413,891,0008,997,0002,506,752