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 listMay 18, 2026 01:44M-RochatM-RochatScore: 28,485Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 01:4627,940932,419,653907,377,00014,644,0002,113,536
2May 18, 2026 01:4628,261942,457,211917,841,00014,790,0002,113,536
3May 18, 2026 01:4628,322944,776,667919,792,00014,844,0002,113,536
4May 18, 2026 01:4628,351946,744,151920,361,00015,231,0002,113,536
5May 18, 2026 01:4628,485950,059,822924,440,00015,578,0002,113,536
6May 18, 2026 01:4628,856963,892,033937,149,00015,119,0002,113,536
7May 18, 2026 01:4628,892963,456,450938,440,00015,026,0002,113,536
8May 18, 2026 01:4628,954964,901,621940,166,00015,347,0002,113,536
9May 18, 2026 01:4629,021967,100,148942,315,00015,401,0002,113,536