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 listOct 17, 2026 06:25e1011e1011Score: 78,664Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 06:2677,9562,583,406,5612,564,184,0008,371,0002,113,536
2Oct 17, 2026 06:2678,0912,587,876,5582,568,733,0008,294,0002,113,536
3Oct 17, 2026 06:2678,4502,599,785,3452,579,972,0008,882,0002,113,536
4Oct 17, 2026 06:2678,5542,603,341,2082,583,353,0008,960,0002,113,536
5Oct 17, 2026 06:2678,6642,606,756,8542,586,814,0009,109,0002,113,536
6Oct 17, 2026 06:2678,7652,610,738,8182,590,936,0008,323,0002,113,536
7Oct 17, 2026 06:2678,7662,610,341,7212,590,809,0008,500,0002,113,536
8Oct 17, 2026 06:2679,0442,619,899,3212,599,853,0008,617,0002,113,536
9Oct 17, 2026 06:2679,4612,632,972,9932,613,857,0008,378,0002,113,536