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 11, 2026 20:29Pavel SkripkinPavel SkripkinScore: 13,828Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 20:3012,486421,240,496409,363,0002,680,0002,117,632
2May 11, 2026 20:3012,930434,973,747424,110,0002,609,0002,117,632
3May 11, 2026 20:3013,113440,076,893430,095,0002,666,0002,117,632
4May 11, 2026 20:3013,794464,538,343452,522,0002,682,0002,117,632
5May 11, 2026 20:3013,828465,028,784453,609,0002,725,0002,117,632
6May 11, 2026 20:3014,111474,306,723462,858,0002,811,0002,117,632
7May 11, 2026 20:3014,583490,088,862478,625,0002,638,0002,117,632
8May 11, 2026 20:3014,627493,374,483480,068,0002,647,0002,117,632
9May 11, 2026 20:3015,103505,739,498495,647,0002,759,0002,117,632