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 2, 2026 22:58zielajzielajScore: 3,236Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 22:563,177124,983,442102,838,0001,996,0002,506,752
2Jan 2, 2026 22:563,183127,783,209103,054,0002,001,0002,535,424
3Jan 2, 2026 22:583,230130,545,163105,579,0001,005,0002,535,424
4Jan 2, 2026 22:583,236130,146,434105,786,000997,0002,412,544
5Jan 2, 2026 22:583,242127,264,971105,974,000999,0002,416,640
6Jan 2, 2026 22:563,256131,674,759106,433,0001,004,0002,269,184