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 19:03Pavel SkripkinPavel SkripkinScore: 11,512Success
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 19:0611,209379,688,360366,844,0003,068,0002,117,632
2May 13, 2026 19:0611,278380,088,579369,133,0003,052,0002,117,632
3May 13, 2026 19:0611,424384,415,214373,844,0003,158,0002,117,632
4May 13, 2026 19:0611,471387,375,836375,464,0003,099,0002,117,632
5May 13, 2026 19:0611,512389,327,246376,698,0003,208,0002,117,632
6May 13, 2026 19:0612,035405,390,526393,973,0003,189,0002,117,632
7May 13, 2026 19:0612,146411,752,656397,648,0003,186,0002,117,632
8May 13, 2026 19:0612,184411,253,166398,913,0003,188,0002,117,632
9May 13, 2026 19:0612,971437,910,450424,850,0003,197,0002,117,632