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 13, 2026 05:06Josu San MartinJosu San MartinScore: 3,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 13, 2026 05:073,478124,196,280113,669,0001,105,0002,113,536
2May 13, 2026 05:073,478123,573,851113,674,0001,116,0002,113,536
3May 13, 2026 05:073,482126,485,153113,809,0001,117,0002,113,536
4May 13, 2026 05:073,483125,407,653113,888,0001,078,0002,113,536
5May 13, 2026 05:073,485123,874,588113,912,0001,122,0002,113,536
6May 13, 2026 05:073,486125,800,189113,947,0001,120,0002,117,632
7May 13, 2026 05:073,487126,086,920113,959,0001,122,0002,113,536
8May 13, 2026 05:073,489125,585,783114,032,0001,112,0002,113,536
9May 13, 2026 05:073,510126,507,269114,794,0001,058,0002,113,536