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 10, 2026 00:56Josu San MartinJosu San MartinScore: 106,039Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2026 00:56105,68012,709,740,3511,363,280,0002,124,157,0002,473,984
2Jan 10, 2026 00:56106,03912,422,465,5761,364,131,0002,135,163,0002,506,752
3Jan 10, 2026 00:56108,79013,578,301,8681,442,847,0002,147,221,0002,527,232