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 listJul 23, 2026 17:17boop34boop34Score: 11,637Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 23, 2026 17:1811,608392,929,580377,912,0005,179,0002,113,536
2Jul 23, 2026 17:1811,614393,101,755378,341,0004,934,0002,113,536
3Jul 23, 2026 17:1811,624393,455,338378,613,0004,997,0002,113,536
4Jul 23, 2026 17:1811,630393,679,483378,592,0005,229,0002,113,536
5Jul 23, 2026 17:1811,637393,867,552378,968,0005,071,0002,113,536
6Jul 23, 2026 17:1811,656394,488,309379,537,0005,128,0002,113,536
7Jul 23, 2026 17:1811,685395,508,710380,598,0005,008,0002,113,536
8Jul 23, 2026 17:1811,685395,497,503380,438,0005,188,0002,113,536
9Jul 23, 2026 17:1811,696395,773,459380,921,0005,059,0002,113,536