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 7, 2026 17:14anboto1anboto1Score: 24,734Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 17:1524,544819,408,259803,309,0006,659,0002,113,536
2Jun 7, 2026 17:1524,550819,881,037803,504,0006,659,0002,113,536
3Jun 7, 2026 17:1524,633822,590,254806,231,0006,673,0002,113,536
4Jun 7, 2026 17:1524,695824,678,972808,339,0006,620,0002,113,536
5Jun 7, 2026 17:1524,734825,610,443809,447,0006,780,0002,113,536
6Jun 7, 2026 17:1524,827830,209,115812,579,0006,719,0002,113,536
7Jun 7, 2026 17:1524,836829,241,148812,888,0006,713,0002,113,536
8Jun 7, 2026 17:1525,653855,885,300839,663,0006,893,0002,113,536
9Jun 7, 2026 17:1526,070873,481,764853,424,0006,893,0002,113,536