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 listApr 17, 2026 21:42Charles CabergsCharles CabergsScore: 62,725Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 21:4262,3892,084,025,9042,041,859,00016,990,0002,453,504
2Apr 17, 2026 21:4262,7252,100,516,2572,055,936,00013,992,0002,457,600
3Apr 17, 2026 21:4262,9712,108,354,7942,063,052,00014,993,0002,457,600