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 12, 2026 23:31Josu San MartinJosu San MartinScore: 3,976Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 23:323,972140,800,230130,006,0001,086,0002,113,536
2May 12, 2026 23:323,972140,950,717129,963,0001,121,0002,113,536
3May 12, 2026 23:323,973139,910,599129,996,0001,124,0002,113,536
4May 12, 2026 23:323,973139,877,364130,067,0001,074,0002,113,536
5May 12, 2026 23:323,976143,177,902130,161,0001,052,0002,113,536
6May 12, 2026 23:323,979141,850,812130,200,0001,125,0002,113,536
7May 12, 2026 23:323,987141,104,095130,462,0001,117,0002,113,536
8May 12, 2026 23:323,994141,986,380130,713,0001,115,0002,113,536
9May 12, 2026 23:323,994140,662,999130,700,0001,122,0002,113,536