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:31Pavel SkripkinPavel SkripkinScore: 16,970Success
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:3315,839531,845,207519,421,0003,287,0002,117,632
2May 13, 2026 19:3315,945534,289,901522,937,0003,262,0002,117,632
3May 13, 2026 19:3315,980536,363,242524,058,0003,285,0002,117,632
4May 13, 2026 19:3316,120540,192,284528,735,0003,226,0002,117,632
5May 13, 2026 19:3316,970568,948,783556,656,0003,365,0002,117,632
6May 13, 2026 19:3317,033570,295,656558,833,0003,276,0002,117,632
7May 13, 2026 19:3317,245579,470,958565,762,0003,333,0002,117,632
8May 13, 2026 19:3317,600589,944,173577,554,0003,274,0002,117,632
9May 13, 2026 19:3317,912601,662,142587,946,0003,160,0002,117,632