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 27, 2026 23:49Victor MerckléVictor MerckléScore: 3,332Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 23:503,322117,498,854108,495,0001,152,0002,113,536
2Jun 27, 2026 23:503,325117,522,990108,663,0001,090,0002,113,536
3Jun 27, 2026 23:503,329117,794,447108,695,0001,163,0002,113,536
4Jun 27, 2026 23:503,331117,734,062108,814,0001,119,0002,113,536
5Jun 27, 2026 23:503,332118,042,993108,780,0001,177,0002,113,536
6Jun 27, 2026 23:503,332117,672,674108,888,0001,093,0002,113,536
7Jun 27, 2026 23:503,333118,325,705108,858,0001,162,0002,113,536
8Jun 27, 2026 23:503,356118,763,394109,578,0001,180,0002,113,536
9Jun 27, 2026 23:503,361118,831,629109,744,0001,186,0002,113,536