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 listJun 8, 2026 02:14anboto1anboto1Score: 19,640Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 02:1519,513653,317,356640,506,0003,445,0002,113,536
2Jun 8, 2026 02:1519,560654,794,252642,140,0003,366,0002,113,536
3Jun 8, 2026 02:1519,575655,511,230642,677,0003,329,0002,113,536
4Jun 8, 2026 02:1519,606656,370,199643,697,0003,320,0002,113,536
5Jun 8, 2026 02:1519,640657,469,090644,715,0003,417,0002,113,536
6Jun 8, 2026 02:1519,656658,473,289645,379,0003,293,0002,113,536
7Jun 8, 2026 02:1519,688659,078,740646,373,0003,337,0002,113,536
8Jun 8, 2026 02:1519,850664,517,316651,765,0003,307,0002,113,536
9Jun 8, 2026 02:1519,930666,989,217654,366,0003,341,0002,113,536