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 listDec 22, 2025 08:11Rajarshi BasuRajarshi BasuScore: 5,010Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 08:114,973186,865,061157,090,0007,004,0002,510,848
2Dec 22, 2025 08:115,003190,475,290159,100,0006,003,0002,408,448
3Dec 22, 2025 08:115,006189,291,500161,206,0004,005,0002,510,848
4Dec 22, 2025 08:115,009191,229,493161,277,0004,006,0002,277,376
5Dec 22, 2025 08:115,010191,143,109161,323,0004,008,0002,363,392
6Dec 22, 2025 08:115,025195,986,905158,831,0006,992,0002,433,024
7Dec 22, 2025 08:115,048190,312,118160,609,0005,985,0002,301,952
8Dec 22, 2025 08:115,049192,695,832162,641,0003,991,0002,502,656
9Dec 22, 2025 08:115,081191,666,622162,674,0004,990,0002,330,624